IDEAS home Printed from https://ideas.repec.org/p/gat/wpaper/1108.html
   My bibliography  Save this paper

Resources Flows Asymmetries in Strict Nash Networks with Partner Heterogeneity

Author

Listed:
  • Pascal Billand

    () (Université de Lyon, Lyon, F-69003, France ; Université Jean Monnet, Saint-Etienne, F-42000, France ; CNRS, GATE Lyon St Etienne, Saint-Etienne, F-42000, France)

  • Christophe Bravard

    () (Université de Lyon, Lyon, F-69007, France ; Université Jean Monnet, Saint-Etienne, F-42000, France ; CNRS, GATE Lyon St Etienne, Saint-Etienne, F-42000, France)

  • Sudipta Sarangi

    () (Department of Economics, Virginia Tech and Louisiana State University)

Abstract

This paper introduces a partner heterogeneity assumption in the one-way flow model of Bala and Goyal (2000, [1]). Our goal consists in the characterization of strict Nash networks with regard to the set of resources obtained by players. We use the notion of condensation network which allows us to divide the population in sets of players who obtain the same resources and we order these sets according to the resources obtained. Accordingly, we can examine the relationship between heterogeneity and asymmetries in networks. We establish that the nature of heterogeneity plays a crucial role on asymmetries observed in equilibrium networks.

Suggested Citation

  • Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2011. "Resources Flows Asymmetries in Strict Nash Networks with Partner Heterogeneity," Working Papers 1108, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
  • Handle: RePEc:gat:wpaper:1108
    as

    Download full text from publisher

    File URL: ftp://ftp.gate.cnrs.fr/RePEc/2011/1108.pdf
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    as
    1. Galeotti, Andrea & Goyal, Sanjeev & Kamphorst, Jurjen, 2006. "Network formation with heterogeneous players," Games and Economic Behavior, Elsevier, vol. 54(2), pages 353-372, February.
    2. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2011. "Strict Nash networks and partner heterogeneity," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(3), pages 515-525, August.
    3. Haller, Hans & Sarangi, Sudipta, 2005. "Nash networks with heterogeneous links," Mathematical Social Sciences, Elsevier, vol. 50(2), pages 181-201, September.
    4. McBride, Michael, 2008. "Position-specific information in social networks: Are you connected?," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 283-295, September.
    5. Andrea Galeotti, 2006. "One-way flow networks: the role of heterogeneity," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 29(1), pages 163-179, September.
    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. Pascal Billand & Christophe Bravard & Sudipta Sarangi & J. Kamphorst, 2011. "Confirming information flows in networks," Post-Print halshs-00672351, HAL.
    2. repec:eee:matsoc:v:89:y:2017:i:c:p:20-31 is not listed on IDEAS
    3. Billand, Pascal & Bravard, Christophe & Kamphorst, Jurjen & Sarangi, Sudipta, 2017. "Network formation when players seek confirmation of information," Mathematical Social Sciences, Elsevier, vol. 89(C), pages 20-31.
    4. Charoensook, Banchongsan, 2015. "On the Interaction between Player Heterogeneity and Partner Heterogeneity in Strict Nash Networks," MPRA Paper 61205, University Library of Munich, Germany.
    5. Charoensook, Banchongsan, 2017. "Violations of Uniform Partner Ranking Condition in Two-way Flow Strict Nash Networks," MPRA Paper 77961, University Library of Munich, Germany.

    More about this item

    Keywords

    Nash networks; one-way flow model; condensation networks; chain; inf-semi-lattice;

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:gat:wpaper:1108. 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: (Nelly Wirth). General contact details of provider: http://edirc.repec.org/data/gateefr.html .

    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.