Competition with an information clearinghouse and asymmetric firms: Why more than two firms compete (or not) for shoppers
Michael Arnold () and
Lan Zhang
Games and Economic Behavior, 2020, vol. 122, issue C, 55-82
Abstract:
We characterize equilibria of a market in which firms with asymmetric loyal customer bases can pay a fixed cost to advertise prices through an information clearinghouse to compete for shoppers. We find that the magnitude of the advertising cost and differences in the sizes of the firms' loyal market shares are critical in determining which firms compete for shoppers in equilibrium. If the advertising cost is sufficiently low, then only the two firms with the smallest loyal market shares advertise and compete for shoppers. However, in contrast to earlier literature, more than two firms compete for shoppers if the advertising cost is sufficiently large and the difference in loyal market shares is sufficiently small. In addition, the advertising probability decreases in the size of the firm's loyal customer base, but larger firms price more competitively when they do advertise.
Keywords: Price comparison site; Clearinghouse; Asymmetric loyal customers; Shoppers; Costly advertising; Price competition (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825620300488
Full text for ScienceDirect subscribers only
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:eee:gamebe:v:122:y:2020:i:c:p:55-82
DOI: 10.1016/j.geb.2020.04.002
Access Statistics for this article
Games and Economic Behavior is currently edited by E. Kalai
More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().