IDEAS home Printed from https://ideas.repec.org/a/spr/joecth/v41y2009i3p515-522.html
   My bibliography  Save this article

A note on the existence of Nash networks in one-way flow models

Author

Listed:
  • Jean Derks
  • Martijn Tennekes

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joecth:v:41:y:2009:i:3:p:515-522
    DOI: 10.1007/s00199-008-0409-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00199-008-0409-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00199-008-0409-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Haller, Hans & Sarangi, Sudipta, 2005. "Nash networks with heterogeneous links," Mathematical Social Sciences, Elsevier, vol. 50(2), pages 181-201, September.
    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. 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.
    4. Galeotti, Andrea & Goyal, Sanjeev & Kamphorst, Jurjen, 2006. "Network formation with heterogeneous players," Games and Economic Behavior, Elsevier, vol. 54(2), pages 353-372, February.
    5. Hans Haller & Jurjen Kamphorst & Sudipta Sarangi, 2007. "(Non-)existence and Scope of Nash Networks," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 31(3), pages 597-604, June.
    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.
    3. Haller, Hans, 2012. "Network extension," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 166-172.
    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.
    5. 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.
    6. 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.

    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. 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. Haller, Hans, 2012. "Network extension," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 166-172.
    3. Breitmoser, Yves & Vorjohann, Pauline, 2013. "Efficient structure of noisy communication networks," Mathematical Social Sciences, Elsevier, vol. 66(3), pages 396-409.
    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.
    5. 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.
    6. 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.
    7. Goeree, Jacob K. & Riedl, Arno & Ule, Aljaz, 2009. "In search of stars: Network formation among heterogeneous agents," Games and Economic Behavior, Elsevier, vol. 67(2), pages 445-466, November.
    8. Ping Sun & Elena Parilina, 2022. "Impact of Utilities on the Structures of Stable Networks with Ordered Group Partitioning," Dynamic Games and Applications, Springer, vol. 12(4), pages 1131-1162, December.
    9. Pietro Battiston, 2016. "Constrained Network Formation," Italian Economic Journal: A Continuation of Rivista Italiana degli Economisti and Giornale degli Economisti, Springer;Società Italiana degli Economisti (Italian Economic Association), vol. 2(3), pages 347-362, November.
    10. Olaizola, Norma & Valenciano, Federico, 2014. "Asymmetric flow networks," European Journal of Operational Research, Elsevier, vol. 237(2), pages 566-579.
    11. Sudipta Sarangi & Pascal Billand & Christophe Bravard, 2006. "Heterogeneity in Nash Networks," Departmental Working Papers 2006-18, Department of Economics, Louisiana State University.
    12. Olaizola, By Norma & Valenciano, Federico, 2021. "Efficiency and stability in the connections model with heterogeneous nodes," Journal of Economic Behavior & Organization, Elsevier, vol. 189(C), pages 490-503.
    13. Pietro Battiston, 2014. "Citations are Forever: Modeling Constrained Network Formation," LEM Papers Series 2014/19, Laboratory of Economics and Management (LEM), Sant'Anna School of Advanced Studies, Pisa, Italy.
    14. 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.
    15. Quqiong He & Sudipta Sarangi & Zhengjia Sun, 2019. "A Note On Asymmetries In Friendship Networks," The Singapore Economic Review (SER), World Scientific Publishing Co. Pte. Ltd., vol. 64(03), pages 799-811, June.
    16. 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.
    17. 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.
    18. Ping Sun & Elena Parilina, 2024. "Networks with nonordered partitioning of players: stability and efficiency with neighborhood-influenced cost topology," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 99(3), pages 271-305, June.
    19. Chenghong Luo & Ana Mauleon & Vincent Vannetelbosch, 2021. "Network formation with myopic and farsighted players," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 71(4), pages 1283-1317, June.
    20. Pascal Billand & Christophe Bravard & Sudipta Sarangi & J. Kamphorst, 2011. "Confirming information flows in networks," Post-Print halshs-00672351, HAL.

    More about this item

    Keywords

    Network formation; Non-cooperative games; C72; D85;
    All these keywords.

    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:spr:joecth:v:41:y:2009:i:3:p:515-522. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.