Dynamic Catalog Mailing Policies

Deciding who should receive a mail-order catalog is among the most important decisions that mail-order-catalog firms must address. In practice, the current approach to the problem is invariably myopic: firms send catalogs to customers who they think are most likely to order from that catalog. In doing so, the firms overlook the long-run implications of these decisions. For example, it may be profitable to mail to customers who are unlikely to order immediately if sending the current catalog increases the probability of a future order. We propose a model that allows firms to optimize mailing decisions by addressing the dynamic implications of their decisions. The model is conceptually simple and straightforward to implement. We apply the model to a large sample of historical data provided by a catalog firm and then evaluate its performance in a large-scale field test. The findings offer support for the proposed model but also identify opportunities for further improvement.

[1]  David G. Stork,et al.  Pattern Classification , 1973 .

[2]  Ronald A. Howard,et al.  Comments on the Origin and Application of Markov Decision Processes , 2002, Oper. Res..

[3]  John Rust.  Structural estimation of markov decision processes , 1986 .

[4]  D. Mast.  Effects of Imagery , 1986 .

[5]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[6]  J. R. Bult,et al.  Optimal Selection for Direct Mail , 1995 .

[7]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[8]  Leemon C. Baird,et al.  Residual Algorithms: Reinforcement Learning with Function Approximation , 1995, ICML.

[9]  Susana V. Mondschein,et al.  Mailing Decisions in the Catalog Sales Industry , 1996 .

[10]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[11]  John N. Tsitsiklis,et al.  Analysis of Temporal-Diffference Learning with Function Approximation , 1996, NIPS.

[12]  J. D. Hess,et al.  Modeling merchandise returns in direct marketing , 1997 .

[13]  Füsun F. Gönül,et al.  Optimal Mailing of Catalogs: a New Methodology Using Estimable Structural Dynamic Programming Models , 1998 .

[14]  David G. Stork,et al.  Pattern classification, 2nd Edition , 2000 .

[15]  Shigeo Abe DrEng.  Pattern Classification , 2001, Springer London.

[16]  A. Fiore,et al.  Effects of imagery copy and product samples on responses toward the product , 2001 .

[17]  Haixun Wang,et al.  Empirical comparison of various reinforcement learning strategies for sequential targeted marketing , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[18]  Ronald A. Howard,et al.  Comments on the Origin and Application of Markov Decision Processes , 2002, Oper. Res..

[19]  D. D. Schoenbachler,et al.  Trust and customer willingness to provide information in database-driven relationship marketing , 2002 .

[20]  Naoki Abe,et al.  Sequential cost-sensitive decision making with reinforcement learning , 2002, KDD.

[21]  Eric T. Anderson,et al.  Does Promotion Depth Affect Long-Run Demand ? , 2002 .

[22]  Arnd Huchzermeier,et al.  Special Issue: 2002 Franz Edelman Award for Achievement in Operations Research and the Management Sciences: Optimizing Rhenania's Mail-Order Business Through Dynamic Multilevel Modeling (DMLM) , 2003, Interfaces.

[23]  Eric T. Anderson,et al.  Long-Run Effects of Promotion Depth on New Versus Established Customers: Three Field Studies , 2004 .

[24]  Shie Mannor,et al.  Biases and Variance in Value Function Estimates , 2004 .

[25]  John N. Tsitsiklis,et al.  Bias and Variance Approximation in Value Function Estimates , 2007, Manag. Sci..