Valuing Customer Portfolios with Endogenous Mass and Direct Marketing Interventions Using a Stochastic Dynamic Programming Decomposition

Published Online:https://doi.org/10.1287/mksc.2014.0848

References

  • Adelman D, Mersereau AJ (2008) Relaxations of weakly coupled stochastic dynamic programs. Oper. Res. 56(3):712–727.LinkGoogle Scholar
  • Anderson TW, Hsiao C (1982) Formulation and estimation of dynamic models using panel data. J. Econometrics 18(1):47–82.CrossrefGoogle Scholar
  • Antos A, Szepesvári C, Munos R (2008) Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path. Learning Theory 71(1):89–129.Google Scholar
  • Arellano M, Bond S (1991) Some tests of specification for panel data: Monte Carlo evidence and an application to employment equations. Rev. Econom. Stud. 58(2):277–297.CrossrefGoogle Scholar
  • Arellano M, Bover O (1995) Another look at the instrumental variable estimation of error-components models. J. Econometrics 68(1):29–51.CrossrefGoogle Scholar
  • Bawa K, Shoemaker RW (1987) The effects of a direct mail coupon on brand choice behavior. J. Marketing Res. 24(4):370–376.CrossrefGoogle Scholar
  • Bellman R (1955) Functional equations in the theory of dynamic programming: Positivity and quasilinearity. Proc. Natl. Acad. Sci. 41(10):743–746.CrossrefGoogle Scholar
  • Bellman R (1957) Dynamic Programming (Princeton University Press, Princeton, NJ).Google Scholar
  • Bellman R (1961) Adaptive Control Processes: A Guided Tour (Princeton University Press, Princeton, NJ).CrossrefGoogle Scholar
  • Benders JF (1962) Partioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1):238–252.CrossrefGoogle Scholar
  • Berry LL (1995) Relationship marketing in services: Growing interest, emerging perspectives. J. Acad. Marketing Sci. 23(4):236–245.CrossrefGoogle Scholar
  • Bertsekas DP (2005) Dynamic Programming and Optimal Control, 3rd ed., Vols. I and II (Athena Scientific, Belmont, MA).Google Scholar
  • Bhattacharya CB, Bolton RN (1999) Relationship marketing in mass markets. Sheth JN, Parvatiyar A, eds. Handbook of Relationship Marketing (Sage, Thousand Oaks, CA), 327–354.Google Scholar
  • Birge JR, Louveaux FV (1997) Introduction to Stochastic Programming (Springer, New York).Google Scholar
  • Bitran GR, Mondschein SV (1996) Mailing decisions in the catalog sales industry. Management Sci. 42(9):1364–1381.LinkGoogle Scholar
  • Blackwell D (1965) Discounted dynamic programming. Ann. Math. Statist. 36(1):226–235.CrossrefGoogle Scholar
  • Blundell R, Bond S (1998) Initial conditions and moment restrictions in dynamic panel data models. J. Econometrics 87(1):115–143.CrossrefGoogle Scholar
  • Bose I, Chen X (2009) Quantitative models for direct marketing: A review from systems perspective. Eur. J. Oper. Res. 195(1):1–16.CrossrefGoogle Scholar
  • Bucklin RE, Lehmann DR, Little JDC (1998) From decision support to decision automation: A 2020 vision. Marketing Lett. 9(3):235–246.CrossrefGoogle Scholar
  • Chen X, Linton O, Robinson P (2001) The estimation of conditional densities. Puri ML, ed. Asymptotic in Statistics and Probability: Papers in Honor of George Gregory Roussas (VSP International Science Publishers, Leiden, The Netherlands), 71–84.Google Scholar
  • Chun BJ, Robinson SM (1995) Scenario analysis via bundle decomposition. Ann. Oper. Res. 56(1):39–63.CrossrefGoogle Scholar
  • Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper. Res. 8(1):101–111.LinkGoogle Scholar
  • Denardo EV (1967) Contraction mappings in the theory underlying dynamic programming. SIAM Rev. 9(2):165–177.CrossrefGoogle Scholar
  • Dubé J-P, Sudhir K, Ching A, Crawford GS, Draganska M, Fox JT, Hartmann Cet al. (2005) Recent advances in structural econometric modeling: Dynamics, product positioning and entry. Marketing Lett. 16(3–4):209–224.CrossrefGoogle Scholar
  • Geoffrion AM (1972) Generalized Benders decomposition. J. Optim. Theory Appl. 10(4):237–260.CrossrefGoogle Scholar
  • Gönül F, Ter Hofstede F (2006) How to compute optimal catalog mailing decisions. Marketing Sci. 25(1):65–74.LinkGoogle Scholar
  • Gönül F, Shi MZ (1998) Optimal mailing of catalogs: A new methodology using estimable structural dynamic programming models. Management Sci. 44(9):1249–1262.LinkGoogle Scholar
  • Gupta S, Lehmann DR (2003) Customers as assets. J. Interactive Marketing 17(1):9–24.CrossrefGoogle Scholar
  • Gupta S, Lehmann DR (2005) Managing Customers as Investments: The Strategic Value of Customers in the Long Run (Wharton School Publishing, Upper Saddle River, NJ).Google Scholar
  • Gupta S, Lehmann DR (2006) Customer lifetime value and firm valuation. J. Relationship Marketing 5(2/3):87–110.CrossrefGoogle Scholar
  • Gupta S, Steenburgh TJ (2008) Allocating marketing resources. Working paper, Harvard University, Cambridge, MA. http://hbswk.hbs.edu/item/5868.html.Google Scholar
  • Gupta S, Zeithaml V (2006) Customer metrics and their impact on financial performance. Marketing Sci. 25(6):718–739.LinkGoogle Scholar
  • Gupta S, Lehmann DR, Stuart JA (2004) Valuing customers. J. Marketing Res. 41(1):7–18.CrossrefGoogle Scholar
  • Gupta S, Mela CF, Vidal-Sanz JM (2009) The value of a “free” customer. UC3M Working Paper 09-2-03, University Carlos III de Madrid, Madrid. http://hdl.handle.net/10016/3883.Google Scholar
  • Heitsch H, Römisch W (2009) Scenario tree modeling for multistage stochastic programs. Math. Programming 118(2):371–406.CrossrefGoogle Scholar
  • Howard RA (1960) Dynamic Programming and Markov Processes (MIT Press, Cambridge, MA).Google Scholar
  • Kamakura WA, Mela CF, Ansari A, Bodapati A, Fader P, Iyengar R, Naik Pet al. (2005) Choice models and customer relationship management. Marketing Lett. 16(3/4):279–291.CrossrefGoogle Scholar
  • Khan R, Lewis M, Singh V (2009) Dynamic customer management and the value of one-to-one marketing. Marketing Sci. 28(6):1063–1079.LinkGoogle Scholar
  • Kolmogorov AN, Fomin SV (1970) Introductory Real Analysis (Dover Publications, New York).Google Scholar
  • Lewis M (2005) A dynamic programming approach to customer relationship pricing. Management Sci. 51(6):986–994.LinkGoogle Scholar
  • Ljungqvist L, Sargent TJ (2004) Recursive Macroeconomic Theory, 2nd ed., Vol. 1 (MIT Press, Cambridge, MA).Google Scholar
  • Mantrala M (2002) Allocating marketing resources. Weitz BA, Wensley R, eds. Handbook of Marketing (Sage, Thousand Oaks, CA), 409–435.CrossrefGoogle Scholar
  • Marcet A, Marshall DA (1994) Convergence of approximate model solutions to rational expectations equilibria using the method of parameterized expectations. Kellogg Graduate School of Management Working Paper 73, Northwestern University, Evanston, IL.Google Scholar
  • McDonald WJ (1998) Direct Marketing: An Integrated Approach (Irwin-McGraw-Hill, Boston).Google Scholar
  • Montoya R, Netzer O, Jedidi K (2010) Dynamic allocation of pharmaceutical detailing and sampling for long-term profitability. Marketing Sci. 29(5):909–924.LinkGoogle Scholar
  • Peppers D, Rogers M, Dorf B (1999) Is your company ready for one-to-one marketing? Harvard Bus. Rev. 77(January–February):151–160.Google Scholar
  • Powell WB (2007) Approximate Dynamic Programming: Solving the Curses of Dimensionality (John Wiley & Sons, Hoboken, NJ).CrossrefGoogle Scholar
  • Puterman ML (1994) Markov Decision Processes: Discrete Stochastic Dynamic Programming (John Wiley & Sons, New York).CrossrefGoogle Scholar
  • Puterman ML, Brumelle SL (1979) On the convergence of policy iteration in stationary dynamic programming. Math. Oper. Res. 4(1):60–69.LinkGoogle Scholar
  • Puterman ML, Shin MC (1978) Modified policy iteration algorithms for discounted Markov decision problems. Management Sci. 24(11):1127–1137.LinkGoogle Scholar
  • Reinartz W, Thomas J, Kumar V (2005) Balancing acquisition and retention resources to maximize customer profitability. J. Marketing 69(1):63–79.CrossrefGoogle Scholar
  • Rincón-Zapatero JP, Rodríguez-Palmero C (2003) Existence and uniqueness of solutions to the Bellman equation in the unbounded case. Econometrica 71(5):1519–1555. [Corrigendum published in Econometrica (2009), 77(1):317–318.]CrossrefGoogle Scholar
  • Roberts ML, Berger PD (1989) Direct Marketing Management (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
  • Rossi PE, McCulloch RE, Allenby GM (1996) The value of purchase history data in target marketing. Marketing Sci. 15(4):321–340.LinkGoogle Scholar
  • Roussas GG (1967) Nonparametric estimation in Markov processes. Ann. Inst. Statist. Math. 21(1):73–87.CrossrefGoogle Scholar
  • Roussas GG (1969) Nonparametric estimation of the transition distribution function of a Markov process. Ann. Math. Statist. 40(4):1386–1400.CrossrefGoogle Scholar
  • Rust J (1997) Using randomization to break the curse of dimensionality. Econometrica 65(3):487–516.CrossrefGoogle Scholar
  • Rust RT, Chung TS (2006) Marketing models of service and relationships. Marketing Sci. 25(6):560–580.LinkGoogle Scholar
  • Rust RT, Verhoef PC (2005) Optimizing the marketing interventions mix in intermediate-term CRM. Marketing Sci. 24(3):477–489.LinkGoogle Scholar
  • Rust RT, Lemon KN, Zeithaml VA (2004) Return on marketing: Using customer equity to focus marketing strategy. J. Marketing 68(1):109–127.CrossrefGoogle Scholar
  • Ruszczynski A (1995) On convergence of an augmented Lagrangian decomposition method for sparse convex optimization. Math. Oper. Res. 20(3):634–656.LinkGoogle Scholar
  • Santos MS, Peralta-Alva A (2005) Accuracy of simulations for stochastic dynamic models. Econometrica 73(6):1939–1976.CrossrefGoogle Scholar
  • Santos MS, Rust J (2004) Convergence properties of policy iteration. SIAM J. Control Optim. 42(6):2094–2115.CrossrefGoogle Scholar
  • Schmittlein DC, Peterson RA (1994) Customer base analysis: An industrial purchase process application. Marketing Sci. 13(1):41–67.LinkGoogle Scholar
  • Shankar V (2008) Strategic allocation of marketing resources: Methods and managerial insights. MSI Working Paper 08-207, Marketing Science Institute, Cambridge, MA. http://ssrn.com/abstract=1270804.Google Scholar
  • Silverman W (1986) Density Estimation for Statistics and Data Analysis (Chapman & Hall, London).CrossrefGoogle Scholar
  • Simão HP, Day J, George AP, Gifford T, Powell WB, Nienow J (2009) An approximate dynamic programming algorithm for large-scale fleet management: A case application. Transportation Sci. 43(2):178–197.LinkGoogle Scholar
  • Simão HP, George A, Powell WB, Gifford T, Nienow J, Day J (2010) Approximate dynamic programming captures fleet operations for Schneider National. Interfaces 40(5):1–11.LinkGoogle Scholar
  • Simester DI, Sun P, Tsitsiklis JN (2006) Dynamic catalog mailing policies. Management Sci. 52(5):683–696.LinkGoogle Scholar
  • Tauchen G (1986) Finite state Markov-chain approximations to univariate and vector autoregressions. Econom. Lett. 20(2):177–181.CrossrefGoogle Scholar
  • Venkatesan R, Kumar V (2004) A customer lifetime value framework for customer selection and resource allocation strategy. J. Marketing 68(4):106–125.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.