Design of an optimal frequency reward program in the face of competition

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We optimize the design of a frequency reward program against traditional pricing in a competitive duopoly, where customers measure their utilities in rational economic terms. We assume two kinds of customers: myopic and strategic [19]. Every customer has a prior loyalty bias [6] toward the reward program merchant, a parameter drawn from a known distribution, indicating an additional probability of choosing the reward program merchant over the traditional pricing merchant. Under this model, we characterize the customer behavior: the loyalty bias increases the switching costs [11] of strategic customers until a tipping point, after which they strictly prefer and adopt the reward program merchant. Subsequently, we optimize the reward parameters to maximize the revenue objective of the reward program merchant. We show that under mild assumptions, the optimal parameters for the reward program design to maximize the revenue objective correspond exactly to minimizing the tipping point of customers and are independent of the customer population parameters. Moreover, we characterize the conditions for the reward program to be better when the loyalty bias distribution is uniform - a minimum fraction of population needs to be strategic, and the loyalty bias needs to be in an optimal range. If the bias is high, the reward program creates loss in revenues, as customers effectively gain rewards for “free”, whereas a low value of bias leads to loss in market share to the competing merchant. In short, if a merchant can estimate the customer population parameters, our framework and results provide theoretical guarantees on the pros and cons of running a reward program against traditional pricing.

Cite

CITATION STYLE

APA

Goel, A., & Skochdopole, N. (2017). Design of an optimal frequency reward program in the face of competition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10660 LNCS, pp. 219–236). Springer Verlag. https://doi.org/10.1007/978-3-319-71924-5_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free