IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-00372481.html
   My bibliography  Save this paper

A Note on the Characterization of Nash Networks

Author

Listed:
  • Pascal Billand

    (CREUSET - Centre de Recherche Economique de l'Université de Saint-Etienne - UJM - Université Jean Monnet - Saint-Étienne)

  • Christophe Bravard

    (CREUSET - Centre de Recherche Economique de l'Université de Saint-Etienne - UJM - Université Jean Monnet - Saint-Étienne)

Abstract

In the present paper, we are interested in the one-way flow model of Bala and Goyal (2000) [Bala, V., Goyal, S., 2000. A non-cooperative model of network formation, Econometrica, N. 68 (5), 1181-1229]. We generalize this model by relaxing the authors' assumption concerning the relation between the number of resources obtained by an agent and this agent's payoffs. Firstly, we show that Nash networks are line bases and strict Nash networks are minimum line bases. Secondly, we establish that efficient networks are minimum line bases.

Suggested Citation

  • Pascal Billand & Christophe Bravard, 2005. "A Note on the Characterization of Nash Networks," Post-Print hal-00372481, HAL.
    • Handle: RePEc:hal:journl:hal-00372481
    DOI: 10.1016/j.mathsocsci.2004.10.003
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. 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.
    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. Billand, Pascal & Bravard, Christophe & Sarangi, Sudipta, 2012. "Existence of Nash networks and partner heterogeneity," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 152-158.
    2. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2008. "Existence of Nash networks in one-way flow models," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 37(3), pages 491-507, December.
    3. Sudipta Sarangi & Pascal Billand & Christophe Bravard, 2007. "Existence of Nash Networks in One-Way Flow Models (Revised Version of LSU Working Paper 2006-05)," Departmental Working Papers 2007-02, Department of Economics, Louisiana State University.

    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. Eunae Yoo & Elliot Rabinovich & Bin Gu, 2020. "The Growth of Follower Networks on Social Media Platforms for Humanitarian Operations," Production and Operations Management, Production and Operations Management Society, vol. 29(12), pages 2696-2715, December.
    2. Rajgopal Kannan & Lydia Ray & Sudipta Sarangi, 2007. "The structure of information networks," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 30(1), pages 119-134, January.
    3. Nicolas Carayol & Pascale Roux & Murat Yıldızoğlu, 2008. "In search of efficient network structures: the needle in the haystack," Review of Economic Design, Springer;Society for Economic Design, vol. 11(4), pages 339-359, February.
    4. Mikaela Backman & Charlie Karlsson, 2016. "Determinants of self-employment among commuters and non-commuters," Papers in Regional Science, Wiley Blackwell, vol. 95(4), pages 755-774, November.
    5. 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.
    6. Finneran, Lisa & Kelly, Morgan, 2003. "Social networks and inequality," Journal of Urban Economics, Elsevier, vol. 53(2), pages 282-299, March.
    7. Herings, P. Jean-Jacques & Mauleon, Ana & Vannetelbosch, Vincent, 2020. "Matching with myopic and farsighted players," Journal of Economic Theory, Elsevier, vol. 190(C).
    8. Robert P. Gilles & Lina Mallozzi, 2025. "Gately values of cooperative games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 79(3), pages 723-758, May.
    9. Babus, Ana & Parlatore, Cecilia, 2022. "Strategic fragmented markets," Journal of Financial Economics, Elsevier, vol. 145(3), pages 876-908.
    10. Vasileios Zikos, 2010. "R&D Collaboration Networks in Mixed Oligopoly," Southern Economic Journal, John Wiley & Sons, vol. 77(1), pages 189-212, July.
    11. Liu, Xiaodong & Patacchini, Eleonora & Zenou, Yves & Lee, Lung-Fei, 2011. "Criminal Networks: Who is the Key Player?," Research Papers in Economics 2011:7, Stockholm University, Department of Economics.
    12. Magnan, Nicholas & Spielman, David J. & Lybbert, Travis J. & Gulati, Kajal, 2015. "Leveling with friends: Social networks and Indian farmers' demand for a technology with heterogeneous benefits," Journal of Development Economics, Elsevier, vol. 116(C), pages 223-251.
    13. Cabrales, Antonio & Calvó-Armengol, Antoni & Zenou, Yves, 2011. "Social interactions and spillovers," Games and Economic Behavior, Elsevier, vol. 72(2), pages 339-360, June.
    14. Tesfatsion, Leigh, 1998. "Ex Ante Capacity Effects in Evolutionary Labor Markets with Adaptive Search," ISU General Staff Papers 199810010700001046, Iowa State University, Department of Economics.
    15. Bich, Philippe & Teteryatnikova, Mariya, 2023. "On perfect pairwise stable networks," Journal of Economic Theory, Elsevier, vol. 207(C).
    16. Sofia Priazhkina & Samuel Palmer & Pablo Martín-Ramiro & Román Orús & Samuel Mugel & Vladimir Skavysh, 2024. "Digital Payments in Firm Networks: Theory of Adoption and Quantum Algorithm," Staff Working Papers 24-17, Bank of Canada.
    17. Zhepeng Li & Xiao Fang & Xue Bai & Olivia R. Liu Sheng, 2017. "Utility-Based Link Recommendation for Online Social Networks," Management Science, INFORMS, vol. 63(6), pages 1938-1952, June.
    18. Grabisch, Michel & Rusinowska, Agnieszka, 2011. "Influence functions, followers and command games," Games and Economic Behavior, Elsevier, vol. 72(1), pages 123-138, May.
    19. Eboli, Mario, 2013. "A flow network analysis of direct balance-sheet contagion in financial networks," Kiel Working Papers 1862, Kiel Institute for the World Economy (IfW Kiel).
    20. Jean-François Caulier & Ana Mauleon & Vincent Vannetelbosch, 2013. "Contractually stable networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 483-499, May.

    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:hal:journl:hal-00372481. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.