IDEAS home Printed from https://ideas.repec.org/p/hal/journl/ujm-00162471.html

Existence of Nash networks in one-way flow models

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

This paper addresses the existence of Nash equilibria in one-way flow or directed network models in a number of different settings. In these models players form costly links with other players and obtain resources from them through the directed path connecting them. We find that heterogeneity in the costs of establishing links play a crucial role in the existence of Nash networks. We also provide conditions for the existence of Nash networks in models where costs and values of links are heterogeneous.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Pascal Billand & Christophe Bravard, 2007. "Existence of Nash networks in one-way flow models," Post-Print ujm-00162471, HAL.
    • Handle: RePEc:hal:journl:ujm-00162471
    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
    for a similarly titled item that would be available.

    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. 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. Olaizola, Norma & Valenciano, Federico, 2014. "Asymmetric flow networks," European Journal of Operational Research, Elsevier, vol. 237(2), pages 566-579.
    3. Haller, Hans, 2012. "Network extension," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 166-172.
    4. Breitmoser, Yves & Vorjohann, Pauline, 2013. "Efficient structure of noisy communication networks," Mathematical Social Sciences, Elsevier, vol. 66(3), pages 396-409.
    5. Haller, Hans & Hoyer, Britta, 2019. "The common enemy effect under strategic network formation and disruption," Journal of Economic Behavior & Organization, Elsevier, vol. 162(C), pages 146-163.
    6. Christophe Bravard & Sudipta Sarangi & Pascal Billand, 2008. "A Note on Existence of Nash Networks in One-way Flow," Economics Bulletin, AccessEcon, vol. 3(79), pages 1-4.
    7. Jean Derks & Martijn Tennekes, 2009. "A note on the existence of Nash networks in one-way flow models," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 41(3), pages 515-522, December.
    8. Sumit Joshi & Poorvi Vora, 2013. "Weak and strong multimarket bidding rings," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 53(3), pages 657-696, August.
    9. Norma Olaizola & Federico Valenciano, 2014. "One-way flow network formation under constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 624-643, July.
    10. Kinateder, Markus & Merlino, Luca Paolo, 2023. "Free riding in networks," European Economic Review, Elsevier, vol. 152(C).
    11. Cui, Zhiwei & Wang, Shouyang & Zhang, Jin & Zu, Lei, 2013. "Stochastic stability in one-way flow networks," Mathematical Social Sciences, Elsevier, vol. 66(3), pages 410-421.
    12. repec:ehu:ikerla:8633 is not listed on IDEAS

    More about this item

    JEL classification:

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

    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:hal:journl:ujm-00162471. 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: 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.