Monopoly Sale of a Network Good
AbstractThis paper studies the problem of a monopolist who sells a network good through a price posting scheme. The scheme posts a price of every possible allocation for each buyer, who are then asked to report their private information to the seller. The seller then implements the allocation based on the reports. The social choice functions that are ex post implementable through such a sales scheme are characterized, and the conditions are identified under which the revenue maximizing scheme has the property that the price of a larger network is more affordable than that of a smaller network.
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.
Bibliographic InfoPaper provided by Institute of Social and Economic Research, Osaka University in its series ISER Discussion Paper with number 0794.
Date of creation: Sep 2010
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-10-23 (All new papers)
- NEP-COM-2010-10-23 (Industrial Competition)
- NEP-CTA-2010-10-23 (Contract Theory & Applications)
- NEP-NET-2010-10-23 (Network Economics)
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.:
- 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.
- 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.
- 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.
- 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.
- 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. "Voluntary cost sharing for an excludable public project," Mathematical Social Sciences, Elsevier, vol. 37(2), pages 123-138, March.
- Arun Sundararajan, 2004. "Local Network Effects and Network Structure," Industrial Organization 0412011, EconWPA.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Fumiko Matsumoto).
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.