Should competing firms offer ‘Buy n times, get one free’ loyalty programs? A game-theoretic analysis
Amirhossein Bazargan,
Saeed Zolfaghari and
Salma Karray
Journal of the Operational Research Society, 2020, vol. 71, issue 2, 280-300
Abstract:
This study investigates the profitability of ‘Buy n, get one free’ loyalty programs (LPs) for competing firms deciding on whether to offer such LP. We use a game-theoretic approach and obtain the equilibrium by considering four subgames; two symmetric ones where both firms either offer or do not offer a LP, and two asymmetric ones where only one firm offers a LP. We derive the demand using an analytical choice model. Then, we obtain the firms’ optimal decision variables (prices and reward periods) and profits for each subgame under different combinations of behavioral parameters of time and reward valuations for both symmetric and asymmetric production cost for the firms. The results show that when customers highly value reward but not time, offering loyalty programs is a dominant strategy. However, under different market conditions, firms face a prisoner dilemma or find that not offering a LP is a dominant equilibrium.
Date: 2020
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2018.1535266 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:taf:tjorxx:v:71:y:2020:i:2:p:280-300
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20
DOI: 10.1080/01605682.2018.1535266
Access Statistics for this article
Journal of the Operational Research Society is currently edited by Tom Archibald
More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().