Coordinating adoption decisions under externalities and incomplete information
AbstractA monopolist sells a good whose value depends on the number of buyers who adopt it as well as on their private types. The seller coordinates the buyersʼ adoption decisions based on their reported types, and charges them the price based on the number of adoptions. We study ex post implementable sales schemes that are collusion-proof, and show that under the revenue maximizing scheme, more buyer types are willing to adopt when there are more adoptions, and the number of adoptions is maximized subject to the participation constraints.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 77 (2013)
Issue (Month): 1 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Network externalities; Strategy-proofness; Revenue maximization; Coalition; Collusion; User group;
Find related papers by JEL classification:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Masaki Aoyagi, 2010.
"Optimal Sales Schemes against Interdependent Buyers,"
American Economic Journal: Microeconomics,
American Economic Association, vol. 2(1), pages 150-82, February.
- Masaki Aoyagi, 2005. "Optimal Sales Schemes against Interdependent Buyers," ISER Discussion Paper 0645, Institute of Social and Economic Research, Osaka University.
- Jack Ochs & In-Uck Park, 2005.
"Overcoming the Coordination Problem: Dynamic Formation of Networks,"
172782000000000046, UCLA Department of Economics.
- Ochs, Jack & Park, In-Uck, 2010. "Overcoming the coordination problem: Dynamic formation of networks," Journal of Economic Theory, Elsevier, vol. 145(2), pages 689-720, March.
- Ochs, Jack & Park, In-Uck, 2004. "Overcoming the Coordination Problem: Dynamic Formation of Networks," CEI Working Paper Series 2004-18, Center for Economic Institutions, Institute of Economic Research, Hitotsubashi University.
- In-Uck Park, 2003.
"A Simple Inducement Scheme to Overcome Adoption Externalities,"
The Centre for Market and Public Organisation
03/085, Department of Economics, University of Bristol, UK.
- Park In-Uck, 2004. "A Simple Inducement Scheme to Overcome Adoption Externalities," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 4(1), pages 1-26, June.
- Gale, Douglas, 2001. "Monotone Games with Positive Spillovers," Games and Economic Behavior, Elsevier, vol. 37(2), pages 295-320, November.
- Dybvig, Philip H. & Spatt, Chester S., 1983. "Adoption externalities as public goods," Journal of Public Economics, Elsevier, vol. 20(2), pages 231-247, March.
- H. Moulin, 1980. "On strategy-proofness and single peakedness," Public Choice, Springer, vol. 35(4), pages 437-455, January.
- Gale, D., 1992.
"Dynamic Coordiantion Games,"
13, Boston University - Department of Economics.
- Katz, Michael L & Shapiro, Carl, 1985. "Network Externalities, Competition, and Compatibility," American Economic Review, American Economic Association, vol. 75(3), pages 424-40, June.
- Katz, Michael L & Shapiro, Carl, 1986. "Technology Adoption in the Presence of Network Externalities," Journal of Political Economy, University of Chicago Press, vol. 94(4), pages 822-41, August.
- Luis Cabral & David Salant & Glenn Woroch, 1994.
"Monopoly Pricing With Network Externalities,"
- Deb, Rajat & Razzolini, Laura, 1999. "Voluntary cost sharing for an excludable public project," Mathematical Social Sciences, Elsevier, vol. 37(2), pages 123-138, March.
- Moulin, Herve, 1994. "Serial Cost-Sharing of Excludable Public Goods," Review of Economic Studies, Wiley Blackwell, vol. 61(2), pages 305-25, April.
- Segal, Ilya, 2003. "Coordination and discrimination in contracting with externalities: divide and conquer?," Journal of Economic Theory, Elsevier, vol. 113(2), pages 147-181, December.
- Bag, Parimal Kanti & Winter, Eyal, 1999. "Simple Subscription Mechanisms for Excludable Public Goods," Journal of Economic Theory, Elsevier, vol. 87(1), pages 72-94, July.
- Deb, Rajat & Razzolini, Laura, 1999. "Auction-Like Mechanisms for Pricing Excludable Public Goods," Journal of Economic Theory, Elsevier, vol. 88(2), pages 340-368, October.
- Shichijo Tatsuhiro & Nakayama Yuji, 2009. "A Two-Step Subsidy Scheme to Overcome Network Externalities in a Dynamic Game," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 9(1), pages 1-20, February.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.