IDEAS home Printed from https://ideas.repec.org/a/bla/jpbect/v18y2016i2p168-192.html

A Degree-Distance-Based Connections Model with Negative and Positive Externalities

Author

Listed:
  • Christophe Bravard
  • Sudipta Sarangi
  • PHILIPP MÖHLMEIER
  • AGNIESZKA RUSINOWSKA
  • EMILY TANIMURA

Abstract

We develop a modification of the connections model by Jackson and Wolinsky (1996)that takes into account negative externalities arising from the connectivity of direct and indirect neighbors, thus combining aspects of the connections model and the co-author model. We consider a general functional form for agents’ utility that incorporates both the effects of distance and of neighbors’ degree. Consequently, we introduce a framework that can be seen as a degree-distancebased connections model with both negative and positive externalities. Our analysis shows how the introduction of negative externalities modifies certain results about stability and efficiency compared to the original connections model. In particular, we see the emergence of new stable structures, such as a star with links between peripheral nodes. We also identify structures, for example, certain disconnected networks, that are efficient in our model but which could not be efficient in the original connections model. While our results are proved for the general utility function, some of them are illustrated by using a specific functional form of the degree-distancebased utility.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • 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.
  • Handle: RePEc:bla:jpbect:v:18:y:2016:i:2:p:168-192
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1111/jpet.2016.18.issue-2
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or

    for a different version of it.

    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. Möhlmeier, Philipp & Rusinowska, Agnieszka & Tanimura, Emily, 2018. "Competition for the access to and use of information in networks," Mathematical Social Sciences, Elsevier, vol. 92(C), pages 48-63.
    2. Ping Sun & Elena Parilina, 2024. "Stable and efficient networks with neighborhood‐influenced externalities," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 26(3), June.
    3. Hellmann, Tim & Staudigl, Mathias, 2014. "Evolution of social networks," European Journal of Operational Research, Elsevier, vol. 234(3), pages 583-596.
    4. Foerster, Manuel & Mauleon, Ana & Vannetelbosch, Vincent J., 2021. "Shadow links," Journal of Economic Theory, Elsevier, vol. 197(C).
      • FOERSTER Manuel, & MAULEON Ana, & VANNETELBOSCH Vincent,, 2018. "Shadow links," LIDAM Discussion Papers CORE 2018030, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
      • Foerster, Manuel & Mauleon, Ana & Vannetelbosch, Vincent, 2021. "Shadow links," LIDAM Reprints CORE 3171, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Mohsen Mosleh & Peter Ludlow & Babak Heydari, 2016. "Distributed Resource Management in Systems of Systems: An Architecture Perspective," Systems Engineering, John Wiley & Sons, vol. 19(4), pages 362-374, July.
    6. 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.
    7. Jan-Peter Siedlarek, 2023. "Making friends meet: network formation with introductions," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(4), pages 1037-1076, December.
    8. 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.
    9. 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.
    10. Somayeh Koohborfardhaghighi & Jörn Altmann, 2015. "A Network Formation Model for Social Object Networks," Springer Books, in: Zhenji Zhang & Zuojun Max Shen & Juliang Zhang & Runtong Zhang (ed.), Liss 2014, edition 127, pages 615-625, Springer.
    11. Antoine Mandel & Xavier Venel, 2022. "Sequential competition and the strategic origins of preferential attachment," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(3), pages 483-508, 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. Adriani, Fabrizio & Ladley, Dan, 2021. "Social distance, speed of containment and crowding in/out in a network model of contagion," Journal of Economic Behavior & Organization, Elsevier, vol. 190(C), pages 597-625.

    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:bla:jpbect:v:18:y:2016:i:2:p:168-192. 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: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/apettea.html .

    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.