检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安交通大学管理学院
出 处:《预测》2004年第2期61-65,共5页Forecasting
基 金:国家自然科学基金资助项目(70028102);国家自然科学基金优秀创新群体资助项目(70121001);陕西省教育厅专项基金资助项目(02JK009;03JK176);陕西省自然科学基金资助项目(02G11;03G07)
摘 要:利用随机博弈及可评估的结构动态规划技术,提出一种使公司及客户利益都最大的最优回报计划的设计方法。该方法可以根据客户的购买历史计算出最优回报计划的三个结构因素(回报率、回报极限、计划的时间范围)及最优营销组合策略。将该方法用于某超市的客户数据库中,验证了该方法的适用性及可行性。结果表明:合适的回报计划可以促进客户的购买、提高公司的利润及缓解价格竞争。回报极限应该比客户的平均购买水平偏高,回报率应该与回报极限的改变方向一致,计划的时间范围应定在一年左右比较合适。对于累积购买水平较高的客户一般不邮寄商品信息。在回报计划的初期与末期不用打折,中期对那些购买次数很少的客户可以实行相应的降价策略。讨论了实验应用结论对企业CRM实践的指导意义。It presents a method of designing the optimal reward programs in a dynamic environment where customers and firm both maximize their benefit by using stochastic game theory and estimable structural dynamic programming technologies. This method can calculate the optimal of the three structural elements which is reward rate, reward threshold and program time horizon, and it also can calculate the optimal mixed marketing strategies. At the same time, the method is valid and feasible by applying it to the data from one supermarket. It is found that appropriate reward program is good at up-buying, improving firm's profits and relaxing the price competition. The reward threshold should be higher than the customer's average purchase. Reward rate should be adjusted in the same way as reward threshold. The right program time horizon is about one year. It is not necessary to discount with higher frequency and save the money to the customers who doesn't purchase frequently. It is not necessary to discount either at the beginning or ending of the reward program. However, it is necessary to depreciate to low frequency customers in the mid of program time horizon. The guidance significance of experimental research conclusions to CRM is discussed.
关 键 词:最优回报计划 客户效用 客户全生命周期价值(CLV) 马尔可夫完美均衡
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249