Abstract
In this chapter a stochastic dynamic programming model with a Markov chain is proposed to capture customer behavior. The advantage of using Markov chains is that the model can take into account the customers switching between the company and its competitors. Therefore customer relationships can be described in a probabilistic way, see for instance Pfeifer and Carraway [170]. Stochastic dynamic programming is then applied to solve the optimal allocation of the promotion budget for maximizing the Customer Lifetime Value (CLV). The proposed model is then applied to practical data in a computer services company.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Adke S, Deshmukh D (1988) Limit distribution of a high order Markov chain. J Roy Stat Soc Ser B 50:105–108
Altman E (1999) Constrained markov decision processes. Chapman and Hall/CRC, London
Berger P, Nasr N (1998) Customer lifetime value: marketing models and applications. J Interact Market 12:17–30
Berger P, Nasr N (2001) The allocation of promotion budget to maximize customer equity. Omega 29:49–61
Blattberg R, Deighton J (1996) Manage market by the customer equity. Harv Bus Rev 73:136–144
Buzacott J, Shanthikumar J (1993) Stochastic models of manufacturing systems. Prentice-Hall International Editions, New Jersey
Carpenter P (1995) Customer lifetime value: do the math. Market Comput 15:18–19
Chan R, Ng M (1996) Conjugate gradient method for Toeplitz systems. SIAM Rev 38:427–482
Ching W (1997) Circulant preconditioners for failure prone manufacturing systems. Linear Algebra Appl 266:161–180
Ching W (2001) Machine repairing models for production systems. Int J Product Econ 70:257–266
Ching W (2001) Markovian approximation for manufacturing systems of unreliable machines in Tandem. Int J Naval Res Logist 48:65–78
Ching W (2003) Iterative methods for queuing systems with batch arrivals and negative customers. BIT 43:285–296
Ching W, Chan R, Zhou X (1997) Circulant preconditioners for Markov modulated poisson processes and their applications to manufacturing systems. SIAM J Matrix Anal Appl 18:464–481
Ching W, Fung E, Ng M (2002) A multivariate Markov chain model for categorical data sequences and its applications in demand predictions. IMA J Manag Math 13:187–199
Ching W, Fung E, Ng M (2003) A higher-order Markov model for the Newsboy’s problem. JOper Res Soc 54:291–298
Ching W, Ng M, So M (2004) Customer migration, campaign budgeting, revenue estimation: the elasticity of Markov decision process on customer lifetime value. Electron Int J Adv Model Optim 6(2):65–80
Ching W, Ng M, Wong K (2003) Higher-order Markov decision process and its applications in customer lifetime values. In: The 32nd international conference on computers and industrial engineering, vol 2, Limerick, Ireland, pp 821–826, 2003
Ching W, Ng M, Wong K, Atlman E (2004) Customer lifetime value: a stochastic programming approach. J Oper Res Soc 55:860–868
Ching W, Yuen W, Ng M, Zhang S (2006) A linear programming approach for solving optimal advertising policy. IMA J Manag Math 17:83–96
DuWors R, Haines G (1990) Event history analysis measure of brand loyalty. J Market Res 27:485–493
Hughes A, Wang P (1995) Media selection for database marketers. J Direct Market 9:79–84
Jackson B (1985) Winning and keeping industrial customers. Lexington Books, Lexington, MA
Jain D, Singh S (2002) Customer lifetime value research in marketing: a review and future directions. J Interact Market 16:34–46
Kotler P, Armstrong G (1995) Principle of marketing, 7th edn. Prentice Hall, Englewood Cliffs
Leung H, Ching W, Leung I (2008) A stochastic optimization model for consecutive promotion. Qual Technol Quant Manag 5:403–414
Lilien L, Kotler P, Moorthy K (1992) Marketing models. Prentice Hall, Englewood Cliffs
Lin C, Lin Y (2007) Robust analysis on promotion duration for two competitive brands. J Oper Res Soc 1:1–8
Mesak H (2003) On deriving and validating comparative statics of a symmetric model of advertising competition. Comput Oper Res 30:1791–1806
Mesak H, Calloway J (1999) Hybrid subgames and copycat games in a pulsing model of advertising competition. J Oper Res Soc 50:837–849
Mesak H, Means T (1998) Modelling advertising budgeting and allocation decisions using modified multinomial logit market share models. J Oper Res Soc 49:1260–1269
Mesak H, Zhang H (2001) Optimal advertising pulsation policies: a dynamic programming approach. J Oper Res Soc 11:1244–1255
Pfeifer P, Carraway R (2000) Modeling customer relationships as Markov chain. J Int Market 14:43–55
Ross S (2000) Introduction to probability models, 7th edn. Academic, New York
White D (1993) Markov decision processes. Wiley, Chichester
Winston W (1994) Operations research: applications and algorithms, Belmont Calif., 3rd edn. Duxbury, North Scituate
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ching, WK., Huang, X., Ng, M.K., Siu, TK. (2013). Markov Decision Processes for Customer Lifetime Value. In: Markov Chains. International Series in Operations Research & Management Science, vol 189. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-6312-2_5
Download citation
DOI: https://doi.org/10.1007/978-1-4614-6312-2_5
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-6311-5
Online ISBN: 978-1-4614-6312-2
eBook Packages: Business and EconomicsBusiness and Management (R0)