IDEAS home Printed from https://ideas.repec.org/a/bpj/bejtec/vcontributions.4y2004i1n3.html

A Simple Inducement Scheme to Overcome Adoption Externalities

Author

Listed:
  • Park In-Uck

    (University of Pittsburgh, i.park@bristol.ac.uk)

Abstract

Customers of network commodities face coordination problems due to adoption externalities that give rise to multiple, Pareto-ranked equilibria. We investigate the extent to which the coordination problem can be resolved by inducement schemes when agents' preferences are private information. Specifically, we show that all symmetric ``cutoff strategy'' profiles constitute the set of profiles uniquely implementable under an inducement scheme. We derive the ex ante cost of implementing each such profile and characterize simple inducement schemes of the following form that implement it: each scheme specifies a fixed fee that every adopter pays, and a fixed gross subsidy/prize to be randomly allocated to the adopters. We discuss the implications of these findings on the design of optimal schemes for different network organizers. We extend the analysis to preference revelation mechanisms and prove a revenue equivalence result and characterize optimal mechanisms, but find that unique implementation is no longer possible.

Suggested Citation

  • 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.
    • Handle: RePEc:bpj:bejtec:v:contributions.4:y:2004:i:1:n:3
    DOI: 10.2202/1534-5971.1103
    as

    Download full text from publisher

    File URL: https://doi.org/10.2202/1534-5971.1103
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.
    File URL: https://libkey.io/10.2202/1534-5971.1103?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or

    for a different version of it.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jack Ochs, 2006. "Dynamic Network Formation," Working Paper 233, Department of Economics, University of Pittsburgh, revised Jan 2006.
    2. 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.
    3. Aoyagi, Masaki, 2018. "Bertrand competition under network externalities," Journal of Economic Theory, Elsevier, vol. 178(C), pages 517-550.
    4. 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.
    5. Shichijo, Tatsuhiro & Fukuda, Emiko, 2021. "Cost-sharing mechanism for excludable goods with generalized non-rivalry," Journal of Economic Theory, Elsevier, vol. 193(C).
    6. Masaki Aoyagi, 2010. "Monopoly Sale of a Network Good," ISER Discussion Paper 0794, Institute of Social and Economic Research, The University of Osaka.
    7. In-Uck Park, 2004. "Dynamic Formation of Network with Adoption Externalities," Econometric Society 2004 Far Eastern Meetings 662, Econometric Society.
    8. Aoyagi, Masaki, 2013. "Coordinating adoption decisions under externalities and incomplete information," Games and Economic Behavior, Elsevier, vol. 77(1), pages 77-89.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    JEL classification:

    • H23 - Public Economics - - Taxation, Subsidies, and Revenue - - - Externalities; Redistributive Effects; Environmental Taxes and Subsidies
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bpj:bejtec:v:contributions.4:y:2004:i:1:n:3. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.degruyterbrill.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.