Skip to main content
Log in

Overcoming the “recency trap” in customer relationship management

  • Original Empirical Research
  • Published:
Journal of the Academy of Marketing Science Aims and scope Submit manuscript

Abstract

Purchase likelihood typically declines as the length of time since the customer’s previous purchase (“recency”) increases. As a result, firms face a “recency trap,” whereby recency increases for customers who do not purchase in a given period, making it even less likely they will purchase in the next period. Eventually the customer is effectively lost to the firm. We develop and illustrate a modeling approach to target a firm’s marketing efforts, keeping in mind the customer’s recency state. This requires an empirical model that predicts purchase likelihood as a function of recency and marketing, and a dynamic optimization that prescribes the most profitable way to target customers. In our application we find that customers’ purchase likelihoods as well as response to marketing depend on recency. These results are used to show that the targeting of email and direct mail should depend on the customer’s recency and that the optimal decision policy enables the average high recency customer, who currently is virtually worthless to the firm, to become profitable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. Note that given the definition of recency as time since previous purchase, “higher recency” or “increased recency” means a longer time period has elapsed since the customer last purchased.

  2. A customer’s recency state is assigned at the end of the period. As in all CLV models, since we start the calculation from the time the customer makes her or his first purchase, we know the customer is in recency state 1 at the end of period 1. So the probabilities in Table 1 start off with a probability of 1 (the customer buys in period 1) by definition. The customer then has a 0.23 probability of purchase in period 2, because ProbPurchase(1) = 0.23. The subsequent purchase probabilities, and hence the states, are determined by the migration probabilities at the top of Table 1.

  3. Note that if as in Table 1, the highest recency state is ≥20, once ≥20 becomes that customer’s current state and he or she does not buy, he or she “migrates” to state ≥20, since we are collapsing states 20, 21, 22, etc. into one state, ≥20. That is, S+1 is state ≥20 if the current state is ≥20.

  4. Note the exception that since we have 20 recency states, if the customer is in recency state ≥ 20 and doesn’t purchase, he or she remains in state ≥20.

  5. In fact, discussion with the firm’s management suggested that the company was not currently targeting email or direct mail efforts in any way, i.e., they were not using previous purchase, etc., to target marketing. If they had been, this would have created an endogeneity that we would have had to handle in our estimation of the logistic customer response function (see Rhee and McIntyre 2008).

References

  • Ackoff, R. L., & Emshoff, J. R. (1975). Advertising research at Anheuser-Busch, Inc (1963–68). Sloan Management Review, 16(2), 1–15.

    Google Scholar 

  • Ansari, A., Mela, C. F., & Neslin, S. A. (2008). Customer channel migration. Journal of Marketing Research, 45(1), 60–76.

    Article  Google Scholar 

  • Berger, P. D., & Nasr, N. I. (1998). Customer lifetime value: marketing models and applications. Journal of Interactive Marketing (John Wiley & Sons), 12(1), 17–30.

    Article  Google Scholar 

  • Beswick, C. A. (1977). Allocating selling effort via dynamic programming. Management Science, 23(7), 667–678.

    Article  Google Scholar 

  • Bitran, G. R., & Mondschein, S. V. (1996). Mailing decisions in the catalog sales industry. Management Science, 42(9), 1364–1381.

    Article  Google Scholar 

  • Blattberg, R. C., Byung-Do, K., & Neslin, S. A. (2008). Database marketing analyzing and managing customers. New York: Springer.

    Book  Google Scholar 

  • Bult, J. R., & Wansbeek, T. (1995). Optimal selection for direct mail. Marketing Science, 14(4), 378–394.

    Article  Google Scholar 

  • Dreze, X., & Bonfrer, A. (2008). An empirical investigation of the impact of communication timing on customer equity. Journal of Interactive Marketing, 22(1), 36–50.

    Article  Google Scholar 

  • Elsner, R., Krafft, M., & Huchzermeier, A. (2003). Optimizing rhenania’s mail-order business through dynamic multilevel modeling (DMLM). Interfaces, 33(1), 50–66.

    Article  Google Scholar 

  • Elsner, R., Krafft, M., & Huchzermeier, A. (2004). The 2003 ISMS practice prize winner-optimizing rhenania’s direct marketing business through dynamic multilevel modeling (DMLM) in a multicatalog-brand environment. Marketing Science, 23(2), 192–206.

    Article  Google Scholar 

  • Fader, P. S., Hardie, B. G. S., & Lee, K. L. (2005). RFM and CLV: using iso-value curves for customer base analysis. Journal of Marketing Research, 42(4), 415–430.

    Article  Google Scholar 

  • Fader, P. S., Hardie, B. G. S., & Jerath, K. (2007). “Estimating CLV using aggregated data: the tuscan lifestyles case revisited. Journal of Interactive Marketing, 21(3), 55–71.

    Article  Google Scholar 

  • Freedman, J. L., & Fraser, S. C. (1966). compliance without pressure: the foot-in-the-door technique. Journal of Personality and Social Psychology, 4(2), 195–202.

    Article  Google Scholar 

  • Gönül, F., & Shi, M. Z. (1998). Optimal mailing of catalogs: a new methodology using estimable structural dynamic programming models. Management Science, 44(9), 1249–1262.

    Article  Google Scholar 

  • Gönül, F., Kim, B.-D., & Shi, M. (2000). Mailing smarter to catalog customers. Journal of Interactive Marketing, 14(2), 2–16.

    Article  Google Scholar 

  • Hughes, A. M. (1996). The complete database marketer, revised. New York: McGraw-Hill.

    Google Scholar 

  • Judd, K. L. (1998). Numerical methods in economics. Cambridge: MIT Press.

    Google Scholar 

  • Keane, M. P., & Wolpin, K. I. (1994). The solution and estimation of discrete choice dynamic programming models by simulation and interpolation. Review of Economic Statistics, 76(4), 648–672.

    Article  Google Scholar 

  • Khan, R., Lewis, M., & Singh, V. (2009). Dynamic customer management and the value of one-to-one marketing. Marketing Science, 28(6), 1063–1079.

    Article  Google Scholar 

  • Leeflang, P. S. H., Wittink, D. R., Wedel, M., & Naert, P. A. (2000). Building models for marketing decisions. Boston: Kluwer.

    Google Scholar 

  • Little, J. D. C. (1970). Models and managers-concept of a decision calculus. Management Science Series B-Application, 16(8), B466–B485.

    Google Scholar 

  • Miglautsch, J. (2002). Application of RFM principles: what to do with 1-1-1 customers? Journal of Database Marketing, 9(4), 319.

    Article  Google Scholar 

  • Montgomery, D. B., Silk, A. J., & Zaragoza, C. E. (1971). A multiple-product sales force allocation model. Management Science, 18(4), P3–P24.

    Google Scholar 

  • Naik, P. A., & Piersma, N. (2002). Understanding the role of marketing communications in direct marketing. Rotterdam: Econometric Institute.

    Google Scholar 

  • Neslin, S. A., Gupta, S., Kamakura, W., Junxiang, L., & Mason, C. H. (2006). Defection detection: measuring and understanding the predictive accuracy of customer churn models. Journal of Marketing Research, 43(2), 204–211.

    Article  Google Scholar 

  • Neslin, S. A., Novak, T. P., Baker, K. R., & Hoffman, D. L. (2009). An optimal contact model for maximizing online panel response rates. Management Science, 55(5), 727–737.

    Article  Google Scholar 

  • Pauwels, K., & Neslin, S. A. (2008). “Building with bricks and mortar: the revenue impact of opening physical stores in multichannel environment.” working paper. Hanover: Tuck School of Business, Dartmouth College.

    Google Scholar 

  • Pfeifer, P. E., & Carraway, R. L. (2000). Modeling customer relationships as markov chains. Journal of Interactive Marketing (John Wiley & Sons), 14(2), 43–55.

    Article  Google Scholar 

  • Ray, M. L., & Sawyer, A. G. (1971). Repetition in media models: a laboratory technique. Journal of Marketing Research, 8(1), 20–29.

    Article  Google Scholar 

  • Reimann, M., Schilke, O., & Thomas, J. S. (2010). Customer relationship management and firm performance: the mediating role of business strategy. Journal of the Academy of Marketing Science, 38(3), 326–346.

    Article  Google Scholar 

  • Rhee, S., & McIntyre, S. (2008). Including the effects of prior and recent contact effort in a customer scoring model for database marketing. Journal of the Academy of Marketing Science, 36(4), 538–551.

    Article  Google Scholar 

  • Rust, R. T., & Verhoef, P. C. (2005). Optimizing the marketing interventions mix in intermediate-term CRM. Marketing Science, 24(3), 477–489.

    Article  Google Scholar 

  • Simester, D. I., Sun, P., & Tsitsiklis, J. N. (2006). Dynamic catalog mailing policies. Management Science, 52(5), 683–696.

    Article  Google Scholar 

  • Tokman, M., Davis, L. M., & Lemon, K. N. (2007). The WOW factor: creating value through win-back offers to reacquire lost customers. Journal of Retailing, 83(1), 47–64.

    Article  Google Scholar 

  • Van den Poel, D., & Leunis, J. (1998). Database marketing modeling for financial services using hazard rate models. International Review of Retail, Distribution & Consumer Research, 8(2), 243–257.

    Article  Google Scholar 

  • Van Diepen, M., Donkers, B., & Franses, P. H. (2009). ”Does Irritation Induced by Charitable Direct Mailings Reduce Donations? International Journal of Research in Marketing, 26(3), 180–188.

    Article  Google Scholar 

  • Venkatesan, R., Kumar, V., & Bohling, T. (2007). Optimal customer relationship management using bayesian decision theory: an application for customer selection. Journal of Marketing Research, 44(4), 579–594.

    Article  Google Scholar 

  • Zoltners, A. A., & Sinha, P. (1980). Integer programming models for sales resource allocation. Management Science, 26(3), 242–260.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Scott A. Neslin.

Additional information

The authors are grateful to Brett Gordon for his help and guidance in implementing the value iteration method used in this work. We are also grateful for comments made by Olivier Toubia and students in his marketing models seminar. We are indebted to Rong Guo for preparing the data used in the analysis. We thank an anonymous online food service company for providing the data used in this research. Finally, we thank the three anonymous reviewers for their valuable comments and suggestions.

Appendix

Appendix

Value iteration algorithm used to derive the optimal policy (D*|S)

  1. 1.

    Let V(S)w = the value function at iteration w for a customer who is in state S.

  2. 2.

    We have two decision variables—email effort and direct mail effort. These each range from 0 to 3 (3 is the maximum value of these variables in the data, and we wanted to stay within the range of the data). We divide each of these variables into 30 increments of 0.1. Therefore, the policy function (D|S) is a set of two values for each state, consisting of one of 30 possible email decisions and one of 30 possible direct mail decisions.

  3. 3.

    Find initial values, V(S)0. We did this by computing the short-term profit function, π it (S) for each of the 900 possible email/direct mail combinations, for each state, and taking the maximum as the initial value, V(S)0.

  4. 4.

    For each state the maximum value of \( V{{(S)}^w} = \mathop{{\max }}\limits_D \left\{ {\pi (S) + \delta (ProbPurch \times V{{{\left( {{{S}^{\prime }}} \right)}}^{{w - 1}}} + \left( {1 - ProbPurch) \times V{{{\left( {{{S}^{{\prime \prime }}}} \right)}}^{{w - 1}}}} \right)} \right\} \) by trying all 900 possible combinations of email and direct mail. Call the combination that produces this maximum (D *|S).

  5. 5.

    Test whether V(S)wV(S)w−1 <0.00001 for each state S. If this holds, the process has converged and the current value of V(S)w is the value function for customers in state S, and the most recently used combination of email and dmail is the optimal policy function (D *|S). If the condition does not hold for all states S, set V(S)w−1 = V(S)w and proceed back to step 4 for another iteration. Note that we have updated the value function because now in step 4, the new value functions we created on the left side of the equation will be on the right side of the equation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Neslin, S.A., Taylor, G.A., Grantham, K.D. et al. Overcoming the “recency trap” in customer relationship management. J. of the Acad. Mark. Sci. 41, 320–337 (2013). https://doi.org/10.1007/s11747-012-0312-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11747-012-0312-7

Keywords

Navigation