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

Competition for the access to and use of information in networks

Author

Listed:
  • Philipp Moehlmeier

    (Universität Bielefeld = Bielefeld University)

  • Agnieszka Rusinowska

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique, CNRS - Centre National de la Recherche Scientifique, PSE - Paris School of Economics - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)

  • Emily Tanimura

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique, UP1 - Université Paris 1 Panthéon-Sorbonne)

Abstract

In a network formation framework, where payoffs reflect an agent's ability to access information from direct and indirect contacts, we integrate negative externalities due to connectivity associated with two types of effects: competition for the access to information, and rivalrous use of information. We consider two separate models to capture the first and the second situations, respectively. In the first model we assume that information is a non-rivalrous good but that there is competition for the access to information, for example because an agent with many contacts must share his time between them and thus has fewer opportunities to pass on information to each particular contact. In the second model we do not assume that there is competition for the access to information, but rather that the use of information is rivalrous. In this case, it is assumed that when people are closer to the sender than an agent, the harmful effect is greater than when others are at the same distance to the sender as that agent. In both models we analyze pairwise stability and examine if the stability of a structure is preserved when the number of agents becomes very large. This leads to a new concept that we call asymptotic pairwise stability. We show that there can exist a tension between asymptotic pairwise stability and efficiency. The results allow us to compare and contrast the effects of two kinds of competition for information.

Suggested Citation

  • Philipp Moehlmeier & Agnieszka Rusinowska & Emily Tanimura, 2018. "Competition for the access to and use of information in networks," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-02196025, HAL.
  • Handle: RePEc:hal:cesptp:hal-02196025
    DOI: 10.1016/j.mathsocsci.2017.09.006
    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. Christophe Bravard & Sudipta Sarangi & PHILIPP MÖHLMEIER & AGNIESZKA RUSINOWSKA & EMILY TANIMURA, 2016. "A Degree-Distance-Based Connections Model with Negative and Positive Externalities," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 18(2), pages 168-192, April.
    2. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2013. "A note on local spillovers, convexity, and the strategic substitutes property in networks," Theory and Decision, Springer, vol. 75(2), pages 293-304, August.
    3. Berno Buechel & Tim Hellmann, 2012. "Under-connected and over-connected networks: the role of externalities in strategic network formation," Review of Economic Design, Springer;Society for Economic Design, vol. 16(1), pages 71-87, March.
    4. 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.
    5. Bloch, Francis & Dutta, Bhaskar, 2009. "Communication networks with endogenous link strength," Games and Economic Behavior, Elsevier, vol. 66(1), pages 39-56, May.
    6. 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.
    7. Sergio Currarini, 2007. "Network design in games with spillovers," Review of Economic Design, Springer;Society for Economic Design, vol. 10(4), pages 305-326, March.
    8. Thayer Morrill, 2011. "Network formation under negative degree-based externalities," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 367-385, May.
    9. Venkatesh Bala & Sanjeev Goyal, 2000. "A Noncooperative Model of Network Formation," Econometrica, Econometric Society, vol. 68(5), pages 1181-1230, September.
    10. Philipp Moehlmeier & Agnieszka Rusinowska & Emily Tanimura, 2016. "A degree-distance-based connections model with negative and positive externalities," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01301736, HAL.
    11. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2012. "Directed Networks with Spillovers," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 14(6), pages 849-878, December.
    12. Charoensook, Banchongsan, 2012. "A noncooperative model of network formation with decreasing productivity," MPRA Paper 36570, University Library of Munich, Germany.
    13. Sanjeev Goyal & Sumit Joshi, 2006. "Unequal connections," International Journal of Game Theory, Springer;Game Theory Society, vol. 34(3), pages 319-349, October.
    14. Tim Hellmann, 2013. "On the existence and uniqueness of pairwise stable networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(1), pages 211-237, February.
    15. Calvo-Armengol, Antoni, 2004. "Job contact networks," Journal of Economic Theory, Elsevier, vol. 115(1), pages 191-206, March.
    16. Scott A. Boorman, 1975. "A Combinatorial Optimization Model for Transmission of Job Information through Contact Networks," Bell Journal of Economics, The RAND Corporation, vol. 6(1), pages 216-249, Spring.
    17. repec:hal:pseose:hal-01387467 is not listed on IDEAS
    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. Currarini, Sergio & Fumagalli, Elena & Panebianco, Fabrizio, 2017. "Peer effects and local congestion in networks," Games and Economic Behavior, Elsevier, vol. 105(C), pages 40-58.
    2. Ping Sun & Elena Parilina, 2021. "Network Formation with Asymmetric Players and Chance Moves," Mathematics, MDPI, vol. 9(8), pages 1-16, April.
    3. 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.

    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. 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.
    2. Hellmann, Tim & Staudigl, Mathias, 2014. "Evolution of social networks," European Journal of Operational Research, Elsevier, vol. 234(3), pages 583-596.
    3. Harmsen - van Hout, Marjolein J.W. & Herings, P. Jean-Jacques & Dellaert, Benedict G.C., 2013. "Communication network formation with link specificity and value transferability," European Journal of Operational Research, Elsevier, vol. 229(1), pages 199-211.
    4. Safi, Shahir, 2022. "Listen before you link: Optimal monitoring rules for communication networks," Games and Economic Behavior, Elsevier, vol. 133(C), pages 230-247.
    5. Christophe Bravard & Sudipta Sarangi & PHILIPP MÖHLMEIER & AGNIESZKA RUSINOWSKA & EMILY TANIMURA, 2016. "A Degree-Distance-Based Connections Model with Negative and Positive Externalities," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 18(2), pages 168-192, April.
    6. Berno Buechel & Tim Hellmann, 2012. "Under-connected and over-connected networks: the role of externalities in strategic network formation," Review of Economic Design, Springer;Society for Economic Design, vol. 16(1), pages 71-87, March.
    7. Pramod C. Mane & Kapil Ahuja & Nagarajan Krishnamurthy, 2020. "Stability, efficiency, and contentedness of social storage networks," Annals of Operations Research, Springer, vol. 287(2), pages 811-842, April.
    8. 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.
    9. Bich, Philippe & Teteryatnikova, Mariya, 2023. "On perfect pairwise stable networks," Journal of Economic Theory, Elsevier, vol. 207(C).
    10. Antoni Calvó-Armengol & Rahmi İlkılıç, 2009. "Pairwise-stability and Nash equilibria in network formation," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(1), pages 51-79, March.
    11. Philippe Bich & Lisa Morhaim, 2020. "On the Existence of Pairwise Stable Weighted Networks," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1393-1404, November.
    12. László Á. Kóczy, 2022. "Core-stability over networks with widespread externalities," Annals of Operations Research, Springer, vol. 318(2), pages 1001-1027, November.
    13. Pramod C. Mane & Nagarajan Krishnamurthy & Kapil Ahuja, 2023. "Resource availability in the social cloud: An economics perspective," Bulletin of Economic Research, Wiley Blackwell, vol. 75(2), pages 541-566, April.
    14. Philippe Bich & Lisa Morhaim, 2017. "On the existence of Pairwise stable weighted networks," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01564591, HAL.
    15. Erol, Selman & Vohra, Rakesh, 2022. "Relationship externalities," Journal of Economic Theory, Elsevier, vol. 206(C).
    16. Pramod C. Mane & Nagarajan Krishnamurthy & Kapil Ahuja, 2019. "Formation of Stable and Efficient Social Storage Cloud," Games, MDPI, vol. 10(4), pages 1-17, November.
    17. Ding, Sihua, 2022. "Link investment substitutability: A factor influencing network formation," Games and Economic Behavior, Elsevier, vol. 136(C), pages 340-359.
    18. Tim Hellmann & Berno Buechel, 2009. "Under-connected and Over-connected Networks," Working Papers 2009.38, Fondazione Eni Enrico Mattei.
    19. Sergio Currarini & Carmen Marchiori & Alessandro Tavoni, 2016. "Network Economics and the Environment: Insights and Perspectives," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 65(1), pages 159-189, September.
    20. Roland Pongou & Roberto Serrano, 2009. "A Dynamic Theory of Fidelity Networks with an Application to the Spread of HIV/AIDS," Working Papers 2009-2, Brown University, Department of Economics.

    More about this item

    JEL classification:

    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation
    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General

    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:cesptp:hal-02196025. 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.