Buy this book
"Abstract:We consider loyalty discounts whereby the seller promises to give buyers who commit to buy from it a lower price than the seller gives to uncommitted buyers. We show that an incumbent seller can use loyalty discounts to soften price competition between itself and a rival, which raises market prices to all buyers. Each individual buyer's agreement to a loyalty discount externalizes most of the harm of that individual agreement onto all the other buyers. The resulting externality among buyers makes it possible for an incumbent to induce buyers to sign these contracts even if they reduce buyer and total welfare. Thus, if the entrant cost advantage is not too large, we prove that with a sufficient number of buyers, there does not exist any equilibrium in which at least some buyers do not sign loyalty discount contracts, and there exists an equilibrium in which all buyers sign and the rival is foreclosed from entry. As a result, with a sufficient number of buyers, an incumbent can use loyalty discounts to increase its profit and decrease both buyer and total welfare. Further, the necessary number of buyers can be as few as three. These effects occur even in the absence of economies of scale in production and even if the buyers are notintermediaries who compete with each other in a downstream market"--John M. Olin Center for Law, Economics, and Business web site.
Buy this book
Subjects
Customer loyalty programs, Discount, Consumer behaviorShowing 1 featured edition. View all 1 editions?
Edition | Availability |
---|---|
1
Robust exclusion through loyalty discounts
2010, Harvard Law School
electronic resource /
in English
|
aaaa
|
Book Details
Edition Notes
Title from PDF file as viewed on 2/4/2010.
Includes bibliographical references.
Also available in print.
System requirements: Adobe Acrobat Reader.
Classifications
External Links
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?History
- Created September 25, 2020
- 1 revision
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
September 25, 2020 | Created by MARC Bot | Imported from Library of Congress MARC record |