[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/p/bge/wpaper/123.html
   My bibliography  Save this paper

Forming Efficient Networks

Author

Listed:
  • David Pérez-Castrillo
  • David Wettstein
Abstract
In this paper, we suggest a simple sequential mechanism whose subgame perfect equilibria give rise to efficient networks. Moreover, the payoffs received by the agents coincide with their Shapley value in an appropriately defined cooperative game.

Suggested Citation

  • David Pérez-Castrillo & David Wettstein, 2004. "Forming Efficient Networks," Working Papers 123, Barcelona School of Economics.
    • Handle: RePEc:bge:wpaper:123
    as

    Download full text from publisher

    File URL: https://www.barcelonagse.eu/sites/default/files/working_paper_pdfs/123.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Navarro, Noemí & Perea, Andrés, 2001. "Bargaining in networks and the myerson value," UC3M Working papers. Economics we016121, Universidad Carlos III de Madrid. Departamento de Economía.
    2. Perez-Castrillo, David & Wettstein, David, 2001. "Bidding for the Surplus : A Non-cooperative Approach to the Shapley Value," Journal of Economic Theory, Elsevier, vol. 100(2), pages 274-294, October.
    3. Sergio Currarini & Massimo Morelli, 2000. "original papers : Network formation with sequential demands," Review of Economic Design, Springer;Society for Economic Design, vol. 5(3), pages 229-249.
    4. Dutta, Bhaskar & Mutuswami, Suresh, 1997. "Stable Networks," Journal of Economic Theory, Elsevier, vol. 76(2), pages 322-344, October.
      • Dutta, Bhaskar & Mutuswami, Suresh, 1996. "Stable Networks," Working Papers 971, California Institute of Technology, Division of the Humanities and Social Sciences.
    5. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
    6. Jackson, Matthew O. & Wolinsky, Asher, 1996. "A Strategic Model of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 71(1), pages 44-74, October.
    7. Mutuswami, Suresh & Winter, Eyal, 2002. "Subscription Mechanisms for Network Formation," Journal of Economic Theory, Elsevier, vol. 106(2), pages 242-264, October.
    8. Mutuswami, Suresh & Perez-Castrillo, David & Wettstein, David, 2004. "Bidding for the surplus: realizing efficient outcomes in economic environments," Games and Economic Behavior, Elsevier, vol. 48(1), pages 111-123, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    2. Sylvain Béal & Eric Rémila & Philippe Solal, 2017. "A strategic implementation of the sequential equal surplus division rule for digraph cooperative games," Annals of Operations Research, Springer, vol. 253(1), pages 43-59, June.
    3. van den Brink, René & van der Laan, Gerard & Moes, Nigel, 2013. "A strategic implementation of the Average Tree solution for cycle-free graph games," Journal of Economic Theory, Elsevier, vol. 148(6), pages 2737-2748.
    4. repec:hal:pseose:halshs-01207823 is not listed on IDEAS
    5. Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
    6. Kamijo, Yoshio, 2008. "Implementation of weighted values in hierarchical and horizontal cooperation structures," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 336-349, November.
    7. Matsubayashi, Nobuo & Yamakawa, Shigetaka, 2006. "A note on network formation with decay," Economics Letters, Elsevier, vol. 93(3), pages 387-392, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
    2. Mutuswami, Suresh & Perez-Castrillo, David & Wettstein, David, 2004. "Bidding for the surplus: realizing efficient outcomes in economic environments," Games and Economic Behavior, Elsevier, vol. 48(1), pages 111-123, July.
    3. Bloch, Francis & Jackson, Matthew O., 2007. "The formation of networks with transfers among players," Journal of Economic Theory, Elsevier, vol. 133(1), pages 83-110, March.
    4. Jackson, Matthew O. & van den Nouweland, Anne, 2005. "Strongly stable networks," Games and Economic Behavior, Elsevier, vol. 51(2), pages 420-444, May.
    5. Suresh Mutuswami & David Pérez-Castrillo & David Wettstein, 2001. "Bidding for the Surplus: Realizing Efficient Outcomes in General Economic Environments," UFAE and IAE Working Papers 479.01, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
    6. Pin, Paolo, 2011. "Eight degrees of separation," Research in Economics, Elsevier, vol. 65(3), pages 259-270, September.
    7. Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
    8. Matthew O. Jackson, 2003. "A Survey of Models of Network Formation: Stability and Efficiency," Game Theory and Information 0303011, University Library of Munich, Germany.
    9. Carayol, Nicolas & Delille, Rémy & Vannetelbosch, Vincent, 2015. "Allocating value among farsighted players in network formation," Economics Letters, Elsevier, vol. 137(C), pages 50-53.
    10. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    11. Sergio Currarini & Carmen Marchiori & Alessandro Tavoni, 2016. "Network Economics and the Environment: Insights and Perspectives," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 65(1), pages 159-189, September.
    12. Sébastien Vivier-Lirimont, 2004. "Interbanking networks: towards a small financial world?," Cahiers de la Maison des Sciences Economiques v04046, Université Panthéon-Sorbonne (Paris 1).
    13. Joost Vandenbossche & Thomas Demuynck, 2013. "Network Formation with Heterogeneous Agents and Absolute Friction," Computational Economics, Springer;Society for Computational Economics, vol. 42(1), pages 23-45, June.
    14. Neligh, Nathaniel, 2020. "Vying for dominance: An experiment in dynamic network formation," Journal of Economic Behavior & Organization, Elsevier, vol. 178(C), pages 719-739.
    15. Matthew O. Jackson, 2002. "The Stability and Efficiency of Economic and Social Networks," Microeconomics 0211011, University Library of Munich, Germany.
    16. Gilles, R.P. & Sarangi, S., 2003. "The Role of Trust in Costly Network Formation," Discussion Paper 2003-53, Tilburg University, Center for Economic Research.
    17. Page, Frank Jr. & Wooders, Myrna H. & Kamat, Samir, 2005. "Networks and farsighted stability," Journal of Economic Theory, Elsevier, vol. 120(2), pages 257-269, February.
    18. Noemí NAVARRO & Róbert VESZTEG, 2007. "Fair ultimatum: an experimental study of the Myerson value," Cahiers de Recherches Economiques du Département d'économie 07.05, Université de Lausanne, Faculté des HEC, Département d’économie.
    19. Antoni Calvo-Armengol & Matthew O. Jackson, 2002. "Social Networks in Determining Employment and Wages: Patterns, Dynamics, and Inequality," Microeconomics 0211007, University Library of Munich, Germany.
    20. Safi, Shahir, 2022. "Listen before you link: Optimal monitoring rules for communication networks," Games and Economic Behavior, Elsevier, vol. 133(C), pages 230-247.

    More about this item

    Keywords

    Networks; Implementation; shapley value;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games

    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:bge:wpaper:123. 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.

    If CitEc recognized a bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Bruno Guallar (email available below). General contact details of provider: https://edirc.repec.org/data/bargses.html .

    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.