IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v81y2013icp11-26.html
   My bibliography  Save this article

The price of imperfect competition for a spanning network

Author

Listed:
  • Moulin, Hervé
  • Velez, Rodrigo A.

Abstract

A buyer procures a network to span a given set of nodes; each seller bids to supply certain edges, then the buyer purchases a minimal cost spanning tree. An efficient tree is constructed in any equilibrium of the Bertrand game.

Suggested Citation

  • Moulin, Hervé & Velez, Rodrigo A., 2013. "The price of imperfect competition for a spanning network," Games and Economic Behavior, Elsevier, vol. 81(C), pages 11-26.
  • Handle: RePEc:eee:gamebe:v:81:y:2013:i:c:p:11-26
    DOI: 10.1016/j.geb.2013.03.012
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825613000572
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Drew Fudenberg & David Levine, 2008. "Limit Games and Limit Equilibria," World Scientific Book Chapters,in: A Long-Run Collaboration On Long-Run Games, chapter 2, pages 21-39 World Scientific Publishing Co. Pte. Ltd..
    2. Bergantinos, Gustavo & Vidal-Puga, Juan J., 2007. "A fair rule in minimum cost spanning tree problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 326-352, November.
    3. Simon, Leo K & Zame, William R, 1990. "Discontinuous Games and Endogenous Sharing Rules," Econometrica, Econometric Society, vol. 58(4), pages 861-872, July.
    4. Stefano Moretti & Rodica Branzei & Henk Norde & Stef Tijs, 2004. "The P-value for cost sharing in minimum," Theory and Decision, Springer, vol. 56(2_2), pages 47-61, February.
    5. Norde, Henk & Moretti, Stefano & Tijs, Stef, 2004. "Minimum cost spanning tree games and population monotonic allocation schemes," European Journal of Operational Research, Elsevier, vol. 154(1), pages 84-97, April.
    6. Tilman Börgers, 1992. "Iterated Elimination of Dominated Strategies in a Bertrand-Edgeworth Model," Review of Economic Studies, Oxford University Press, vol. 59(1), pages 163-176.
    7. Bogomolnaia, Anna & Moulin, Hervé, 2010. "Sharing a minimal cost spanning tree: Beyond the Folk solution," Games and Economic Behavior, Elsevier, vol. 69(2), pages 238-248, July.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    Algorithmic mechanism design; Worst case scenario equilibrium analysis; Frugality; Minimum cost spanning tree problem; Price of imperfect competition;

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C79 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Other
    • D40 - Microeconomics - - Market Structure, Pricing, and Design - - - General
    • D43 - Microeconomics - - Market Structure, Pricing, and Design - - - Oligopoly and Other Forms of Market Imperfection
    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions

    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:eee:gamebe:v:81:y:2013:i:c:p:11-26. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.