OPTIMAL DESIGN OF A MULTITIER REWARD SCHEME. Amir Gandomi *, Saeed Zolfaghari **



Similar documents
A Production Planning Problem

Sharing Online Advertising Revenue with Consumers

Software Anti-piracy and Pricing in a Competitive Environment: a Game Theoretic Analysis

A PREDICTIVE MODEL OF REDEMPTION AND LIABILITY IN LOYALTY REWARD PROGRAMS INDUSTRY

Exam Introduction Mathematical Finance and Insurance

Inflation. Chapter Money Supply and Demand

SPARE PARTS INVENTORY SYSTEMS UNDER AN INCREASING FAILURE RATE DEMAND INTERVAL DISTRIBUTION

A simple analysis of the TV game WHO WANTS TO BE A MILLIONAIRE? R

MODELING CUSTOMER RELATIONSHIPS AS MARKOV CHAINS. Journal of Interactive Marketing, 14(2), Spring 2000, 43-55

1 Portfolio mean and variance

Mathematics of Risk. Introduction. Case Study #1 Personal Auto Insurance Pricing. Mathematical Concepts Illustrated. Background

IJCHM 17,5. Anna S. Mattila Pennsylvania State University, University Park, Pennsylvania, USA

Computing Near Optimal Strategies for Stochastic Investment Planning Problems

Chapter 7. Sealed-bid Auctions

Price Discrimination: Part 2. Sotiris Georganas

Chapter 9 Experience rating

On the Interaction and Competition among Internet Service Providers

Analysis of a Production/Inventory System with Multiple Retailers

5-Step Guide To Successful Loyalty Programs. Combining Technology And Service To Bridge The Loyalty Gap

Research - Unley Business Loyalty Card Program. Author: Chris Williams Business & Economic Development July 2009

6.231 Dynamic Programming and Stochastic Control Fall 2008

Sharing Online Advertising Revenue with Consumers

A Model of Optimum Tariff in Vehicle Fleet Insurance

Moral Hazard. Itay Goldstein. Wharton School, University of Pennsylvania

We hope you will find this sample a useful supplement to your existing educational materials, and we look forward to receiving your comments.

Least Squares Estimation

Price Dispersion. Ed Hopkins Economics University of Edinburgh Edinburgh EH8 9JY, UK. November, Abstract

1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.

1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let

MODELING CUSTOMER RELATIONSHIPS AS MARKOV CHAINS

Single-Period Balancing of Pay Per-Click and Pay-Per-View Online Display Advertisements

Excess Volatility and Closed-End Fund Discounts

Raising the Bar of Customer Loyalty Programs

MATHEMATICS OF FINANCE AND INVESTMENT

Single item inventory control under periodic review and a minimum order quantity

Introduction to time series analysis

3.2 Roulette and Markov Chains

Loyalty program membership: A study of factors influencing customers' decision Introduction

CHAPTER 13 SIMPLE LINEAR REGRESSION. Opening Example. Simple Regression. Linear Regression

A Profit-Maximizing Production Lot sizing Decision Model with Stochastic Demand

Equilibrium: Illustrations

From the probabilities that the company uses to move drivers from state to state the next year, we get the following transition matrix:

Retirement Financial Planning: A State/Preference Approach. William F. Sharpe 1 February, 2006

A Game Theoretical Framework for Adversarial Learning

Managing Customer Retention

Bargaining Solutions in a Social Network

Optimization of technical trading strategies and the profitability in security markets

Applying Customer Analytics to Promotion Decisions WHITE PAPER

Multi-state transition models with actuarial applications c

Market Power and Efficiency in Card Payment Systems: A Comment on Rochet and Tirole

GENERALIZED INTEGER PROGRAMMING

Uncovering Consumer Decision Rules under Complex Dynamic Environments: The Case of Coalition Loyalty Programs

An On-Line Algorithm for Checkpoint Placement

TD(0) Leads to Better Policies than Approximate Value Iteration

ORACLE LOYALTY ANALYTICS

PAST PRESENT FUTURE YoU can T TEll where ThEY RE going if YoU don T know where ThEY ve been.

PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION

INVENTORY MODELS WITH STOCK- AND PRICE- DEPENDENT DEMAND FOR DETERIORATING ITEMS BASED ON LIMITED SHELF SPACE

Supply Chain Management of a Blood Banking System. with Cost and Risk Minimization

Effect of Lead Time on Anchor-and-Adjust Ordering Policy in Continuous Time Stock Control Systems 1

A New Quantitative Behavioral Model for Financial Prediction

RFM Analysis: The Key to Understanding Customer Buying Behavior

1 Interest rates, and risk-free investments

Why do merchants accept payment cards?

How I won the Chess Ratings: Elo vs the rest of the world Competition

Financial Markets. Itay Goldstein. Wharton School, University of Pennsylvania

Introduction to Auction Design

PROFITABLE CUSTOMER ENGAGEMENT Concepts, Metrics & Strategies

An Empirical Investigation of Customer Defection & Acquisition Rates for Declining and Growing Pharmaceutical Brands

SYSTEMS OF REGRESSION EQUATIONS

Retail Analytics: Game Changer for Customer Loyalty

Nonparametric adaptive age replacement with a one-cycle criterion

On closed-form solutions of a resource allocation problem in parallel funding of R&D projects

ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE

Network quality control

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2015

Unraveling versus Unraveling: A Memo on Competitive Equilibriums and Trade in Insurance Markets

Product recommendations and promotions (couponing and discounts) Cross-sell and Upsell strategies

Making loyalty pay: Lessons from the innovators

Credit Card Market Study Interim Report: Annex 5 Firm business model analysis

Two-State Option Pricing

Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh

Applying CRM in Information Product Pricing

Multi-channel Marketing

ADVANCED MARKETING ANALYTICS:

Computing the optimal portfolio policy of an investor facing capital gains tax is a challenging problem:

Hedging Illiquid FX Options: An Empirical Analysis of Alternative Hedging Strategies

Stochastic Inventory Control

Copyright. Network and Protocol Simulation. What is simulation? What is simulation? What is simulation? What is simulation?

11. Time series and dynamic linear models

Adaptive Online Gradient Descent

Prediction of Stock Performance Using Analytical Techniques

Transcription:

OPTIMAL DESIGN OF A MULTITIER REWARD SCHEME Amir Gandomi *, Saeed Zolfaghari ** Department of Mechanical and Industrial Engineering, Ryerson University, Toronto, Ontario * Tel.: + 46 979 5000x7702, Email: agandomi@ryerson.ca ** Tel.: + 46 979 5000x7735, Email: zolfaghari@ryerson.ca Various forms of customer loyalty programs have been designed and adopted in real world markets. A principal element of the loyalty programs design is the reward structure. In this study, an optimization model is developed for a commonly-used yet underexplored type of reward structure known as the multitier reward scheme. Multitier reward schemes offer disproportionately higher rewards to more loyal customers. We study a three-level tiered scheme. The design elements are breakpoints and the reward value at each tier. We model an asymmetric duopoly market where only one firm adopts the multitier loyalty scheme. Customer choice behavior is modeled using the binary-logit model. The utility components are the price, reward and the distance to a reward. The customers accumulated purchase through different periods turns out to form a Markov chain. The transition probabilities are obtained to formulate the firm s revenue function. The revenue function is maximized in terms of the loyalty program s design elements. The structural properties of the optimal solution yield useful insights into the profitability of multitier loyalty programs. Keywords: Marketing, Optimization, Loyalty Programs, Multitier reward, Stochastic Programming.. Introduction Because of the well-established link between customer loyalty and profitability (Reichheld & Teal, 200; Smith & Sparks, 2009), acquiring loyal customers is of growing importance. Loyalty programs are one of the marketing strategies to build and enhance customers' loyalty and thereby increase a firm's long-term profitability (Gandomi & Zolfaghari, 20). Since early 980 s, the contemporary forms of loyalty programs have increasingly grown in popularity and have expanded in various industries including airlines, credit card companies, retail and hotel chains (Kim, Shi, & Srinivasan, 200; Kumar, 2008). On the other end, consumers participation in such programs has considerably evolved during the past few years. The 20 COLLOQUY Loyalty Census reveals that the number of loyalty memberships in the US exceeds 2 billion, netting out to more than 8 memberships per household (COLLOQUY, 20). This indicates a 4.7% increase in memberships in the US since 2000. Given the ubiquity of loyalty programs in practice, academics have recently shown interest in the area. The approaches to research on loyalty programs can be classified into two broad categories. While some researchers use empirical methods to assess the effect of loyalty programs on customers buying behavior (Kivetz & Simonson, 2002; B. Sharp & A. Sharp, 997), some other adopt mathematical models to analyze the effects of loyalty programs on a firm s profitability and market conditions (e.g., Kim et al., 200; Singh, Jain, & Krishnan, 2008; Gandomi & Zolfaghari, 20). However, virtually all existing empirical and analytical studies on loyalty program have considered a particular reward structure known as the linear reward. Specifically, multitier reward scheme has remained understudied in the OR/marketing literature. Based on a multitier reward scheme, more loyal customers earn disproportionately higher rewards. That is, multitier schemes offer different rewards to different levels of loyalty. In other words, the reward per dollar spent is not fixed and depends on some measure of customers purchase history. Some examples of such reward systems are Microsoft s Xbox Live Reward in the US, Shopper s Optimum Card in Canada and British Airways Executive Club in the UK. 992

The reward structure, as one of the main components of a loyalty program s design (Kumar, 2006, p. 72), is a key driver of the loyalty program s effectiveness. Thus, the lack of research on multitier reward schemes is a significant gap in the loyalty programs literature. In this study, a mathematical model is developed to address part of this gap. Specifically, we develop a model to optimize the profitability of the commonly-seen 3-level reward schemes where customers loyalty status is determined based on their accumulated purchase at the end of a selling cycle. The decision variables are the breakpoints and reward values at each tier. We model a duopoly market where only one firm offers loyalty discounts. Customers choose one of the firms and buy one unit of the product in each period. Their choice behavior is modeled using binary-logit model where the utility is a function of the offered price, the reward value and the distance to the reward. By including the distance component in the utility, we address the fact that customers accelerate their purchasing process as they progress toward earning a particular reward (Kivetz, Urminsky, & Zheng, 2006). It will be shown that the customers accumulated purchase evolves as a Markov chain. The transition probabilities of the Markov chain are obtained in terms of the decision variables and are used to formulate the firm s expected revenue function. The revenue function is optimized in terms of the reward scheme s design elements. The optimal solution yields some useful insights into the profitability of multitier reward systems. The rest of the paper is organized as follows: section 2 describes the underlying assumptions and the model formulation. Section 3 presents some sample results derived from the model. We conclude in section 4 with a summary and the future directions. 2. The model formulation The market is served by two firms where only one firm offer loyalty rewards (Firm A). Firms sell the same good/service through the selling cycle which is divided into 4 discrete time periods. The market size is normalized to one and remains constant across periods. Suppose that both Firm A and Firm B offer the same price,, throughout the selling horizon. is incorporated as a parameter in the model. Firm adopts a three-tier reward scheme. Customers progress through reward tiers based on their accumulated purchase at Firm. The reward is determined based on a customer s loyalty status at the end of the selling horizon. Customers who make enough purchases to achieve Tier 2 status earn a reward of and those who make it to Tier 3 win a reward of. and are the breakpoints that specify the limits of each loyalty level. Customers whose total purchase exceeds earn the Tier 3 reward. Tier 2 status is granted to accumulated purchases falling in the range,. If the total purchase is less than, no loyalty reward is offered. Note that and are the monetary values of the breakpoints.,, and are incorporated as Firm s decision variables in the model. In each period, customers buy one unit of the product, either at Firm or at Firm. Here, the binary-logit model is employed to model customers choice behavior. First, let,,,,...,4, () be a customer s utility from buying at Firm in period. is the marginal sensitivity of the utility to the price level and, is the random component of the utility which captures the heterogeneity in customers preferences. Similarly, we can formulate customers utility from buying at Firm. As mentioned earlier, we assume that each individual s utility depends on two additional factors: the reward level in the next tier and the 993

distance to the next tier. The values of both factors in a period depend on a customer s accumulated purchase up until the previous period. Let represent the reward value in the next loyalty tier. Based on Firm s reward scheme described earlier, it follows that:,,,4, (2), where denotes the total money spent by the customer at Firm up to period. We assume that 0, that is, customers initiate accumulating points at the beginning of the selling horizon. Moreover, let denote the distance to the next loyalty level. can be written as a function of as follows:,,,...,4. (3) 0, Having defined and, we can now formulate the net utility derived from making a purchase at Firm in period,,, as follows:,,,,...,4. (4) In the above equation, and denote the utility sensitivity to the price and to the distance from the next reward, respectively and, is the random disturbance term. In every period, customers choose between Firm and Firm. Intuitively, a customer chooses Firm over Firm in period if,,. Hence, the probability that the customer buys at Firm in period,,, is given by,,,,,,,...,4. (5) Now, we adopt the commonly used assumption that, and,,...,4) are i.i.d random variables and,,,...,4) has a logistic distribution with mean zero and scale parameter (Ben-Akiva & Lerman, 985, p. 07). Let. denote the CDF of the distribution. From Equation (5), it follows that,,,...,4. (6) Note that and are piecewise functions and depend upon, the customer s accumulated purchase in period. To formulate Firm s expected revenue function, we need to derive the probability distribution of the accumulated purchase at the end of the selling horizon. That is, we must find Pr for any 0,,4. It can be shown that,..,4 satisfies the conditional independence property and hence evolves according to a Markov chain. For notational simplicity, let,, 4 represent a customer s total number of purchases at Firm up to period. Clearly,,..,4 is also a Markov chain with the state space Ω0,,2,3, 4. Let be the transition probability matrix whose, element is, Pr,,,4, and 0,,4. (7) In other words,, is the probability that a customer s total number of purchases at Firm reaches given that he/she has bought units of the product at Firm up to the previous period. Considering the fact that each customer buys exactly one unit of the product in each period either at Firm or at Firm,, in the above equation can be expressed as 994

,,,,, 0, 0,,4, (8) where, can be derived based on equations (2), (3) and (6) as,,,, 0,,4. (9) Now, Pr can be found using the 4-step transition probability matrix of,. To simplify the notation, let,,,,5, (0) be a vector containing the elements of the first row of. Thus, the entry of represents the probability that a customer buys products over the entire selling cycle. Having found the total purchase probabilities, now we can formulate Firm s expected revenue function,, as follows:, () where denotes the expected cost of reward that Firm incurs during the selling horizon. Based on Firm A s reward structure, it can be shown that where. (2) :, 0,,4 and :, 0,,4. (3) Thus, the revenue function in Equation () can be rewritten as. (4) The purpose is to study the structural properties of Firm s optimal reward scheme. Thus, one can optimize Firm s revenue function,, in terms of,, and. Note that depends also on the model parameters (i.e.,, and ). So, the optimal solution will depend on parameter values. For analytical convenience, we normalize the price to and change and correspondingly, so that the choice probabilities remain the same. Subsequently, after obtaining the optimal solution, the values of decision variables and revenue functions must be scaled back with the same factor. The optimization model can be written as follows: 995

, (5),,, subject to:, (5a) 2, (5b), (5c) 0, (5d) 0, (5e), (5f), (5g),,, 0. (5h) The first two constraints state that at least two purchases are needed to achieve the second tier and minimum three purchases are required to earn the Tier-3 loyalty status. Constraint (5c) guarantees that the reward will not exceed the offered price in any period. Constraints (5d) and (5e) ensure that the net utility that loyalty program creates is non-negative. Constraints (5f) and (5g) refer to the fact that under optimal conditions, the value of the next reward must be less than or equal to the amount of money a customer must pay to gain it. In other words, the distance to the next reward must be less than the reward itself. Otherwise, a customer may basically earn money by making an additional purchase. Thus, without these two constraints, the assumption that customers make only one purchase in each period becomes implausible. 3. Sample results It can be shown that the above model is a non-convex NLP. One can employ the interior-point algorithm proposed by Byrd, Gilbert, & Nocedal (2000) to find the optimal solution. Various analyses can be performed using the developed model. For instance, Figure () presents the effects of and on the optimal breakpoint values. As can be seen, and both increase with and decrease with. That is, as the sensitivity to distance from a reward increases, the firm is better off to set higher requirements for both Tier 2 and Tier 3 loyalty levels. On the other hand, as the customer s sensitivity to price increases, the optimal breakpoints decrease. 2.9 3.9 2.85 2.8 2.75 2.7 2.65 2.0 3.5 3.85 3.8 3.75 3.7 2.0 3.5 2.6 5.0 3.65 2.55 2.5 3.6 5.0 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09 0. 3.55 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09 0. Figure. Optimal values of and under different levels of and 996

4. Conclusion In this paper, an analytical model was developed to optimize the structure of a 3-tier loyalty reward scheme. The decision variables were the breakpoints and reward values of each tier. The purpose was to optimize the total revenue function. The formulation resulted in a nonlinear programming. The optimal solution of the model was found at some arbitrary values of and, the utility sensitivity coefficients. The results can be used to perform various analyses. For example, it is useful to study the effects of and on the optimal values of reward at each tier and each firm s overall profitability. Moreover, we can assume that Firm offers a lower price and then compare the effectiveness of loyalty programs with that of the lower price strategy. In our model, the selling cycle was broken into 4 discrete time periods. One can extend the model to a more general case where the cycle is divided into periods. The model can also be expanded by removing the assumption that the offered price is constant across periods. In fact, this assumption was made to ensure that customers accumulated purchases follow the Markov chain. The stochastic dynamic programming approach can be used to formulate and optimize the revenue function under the variable price assumption. Finally, one can incorporate the offered prices of each firm as decision variables and study the equilibrium conditions using game theoretic models. References Ben-Akiva, M., & Lerman, S. R. (985). Discrete choice analysis: Theory and application to travel demand (st ed.). The MIT Press. Byrd, R. H., Gilbert, J. C., & Nocedal, J. (2000). A trust region method based on interior point techniques for nonlinear programming. Mathematical Programming, 89(), 49-85. COLLOQUY. (20, April). The billion member march: The 20 COLLOQUY loyalty census. Retrieved July 5, 20, from http://www.colloquy.com/files/20-colloquy-census-talk-white- Paper.pdf Gandomi, A., & Zolfaghari, S. (20). A stochastic model on the profitability of loyalty programs. Computers & Industrial Engineering, In Press, Corrected Proof. Kim, B., Shi, M., & Srinivasan, K. (200). Reward programs and tacit collusion. Marketing Science, 20(2), 99-20. Kivetz, R., & Simonson, I. (2002). Earning the right to indulge: Effort as a determinant of customer preferences toward frequency program rewards. Journal of Marketing Research, 39(2), 55-70. Kivetz, R., Urminsky, O., & Zheng, Y. (2006). The goal-gradient hypothesis resurrected: Purchase acceleration, illusionary goal progress, and customer retention. Journal of Marketing Research, 43(), 39-58. Kumar, V. (2006). Customer relationship management: A database approach. Hoboken, N.J: John Wiley & Sons. Kumar, V. (2008). Managing customers for profit: Strategies to increase profits and build loyalty. Indianapolis, IN: Wharton School Publishing. Reichheld, F. F., & Teal, T. (200). The loyalty effect: the hidden force behind growth, profits, and lasting value. Boston, MA: Harvard Business Press. Sharp, B., & Sharp, A. (997). Loyalty programs and their impact on repeat-purchase loyalty patterns. International Journal of Research in Marketing, 4(5), 473-486. Singh, S. S., Jain, D. C., & Krishnan, T. V. (2008). Customer loyalty programs: are they profitable? Management Science, 54(6), 205-2. Smith, A., & Sparks, L. (2009). It s nice to get a wee treat if you ve had a bad week : Consumer motivations in retail loyalty scheme points redemption. Journal of Business Research, 62(5), 542-547. 997