IDEAS home Printed from https://ideas.repec.org/a/ebl/ecbull/eb-08c70064.html
   My bibliography  Save this article

A Note on Existence of Nash Networks in One-way Flow

Author

Listed:
  • Christophe Bravard

    (University of Saint-Etienne)

  • Sudipta Sarangi

    (Louisiana State University)

  • Pascal Billand

    (University of Saint-Etienne)

Abstract

In this note we provide conditions which ensure the existence of Nash networks in One-way flow models with cost heterogeneity.

Suggested Citation

  • 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.
    • Handle: RePEc:ebl:ecbull:eb-08c70064
    as

    Download full text from publisher

    File URL: http://www.accessecon.com/pubs/EB/2008/Volume3/EB-08C70064A.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    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. Olaizola, Norma & Valenciano, Federico, 2014. "Asymmetric flow networks," European Journal of Operational Research, Elsevier, vol. 237(2), pages 566-579.
      • Olaizola Ortega, María Norma & Valenciano Llovera, Federico, 2012. "Asymmetric flow networks," IKERLANAK http://www-fae1-eao1-ehu-, Universidad del País Vasco - Departamento de Fundamentos del Análisis Económico I.
    3. 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.
    4. 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.

    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. 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.
    2. Haller, Hans, 2012. "Network extension," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 166-172.
    3. Billand, Pascal & Bravard, Christophe & Sarangi, Sudipta, 2012. "Existence of Nash networks and partner heterogeneity," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 152-158.
    4. Olaizola, Norma & Valenciano, Federico, 2014. "Asymmetric flow networks," European Journal of Operational Research, Elsevier, vol. 237(2), pages 566-579.
      • Olaizola Ortega, María Norma & Valenciano Llovera, Federico, 2012. "Asymmetric flow networks," IKERLANAK http://www-fae1-eao1-ehu-, Universidad del País Vasco - Departamento de Fundamentos del Análisis Económico I.
    5. 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.
    6. 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.
    7. 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.
    8. Breitmoser, Yves & Vorjohann, Pauline, 2013. "Efficient structure of noisy communication networks," Mathematical Social Sciences, Elsevier, vol. 66(3), pages 396-409.
    9. Kinateder, Markus & Merlino, Luca Paolo, 2023. "Free riding in networks," European Economic Review, Elsevier, vol. 152(C).
    10. 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.

    More about this item

    JEL classification:

    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory

    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:ebl:ecbull:eb-08c70064. 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: John P. Conley (email available below). General contact details of provider: .

    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.