IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1910.11693.html
   My bibliography  Save this paper

Building social networks under consent: A survey

Author

Listed:
  • Robert P. Gilles

Abstract

This survey explores the literature on game-theoretic models of network formation under the hypothesis of mutual consent in link formation. The introduction of consent in link formation imposes a coordination problem in the network formation process. This survey explores the conclusions from this theory and the various methodologies to avoid the main pitfalls. The main insight originates from Myerson's work on mutual consent in link formation and his main conclusion that the empty network (the network without any links) always emerges as a strong Nash equilibrium in any game-theoretic model of network formation under mutual consent and positive link formation costs. Jackson and Wolinsky introduced a cooperative framework to avoid this main pitfall. They devised the notion of a pairwise stable network to arrive at equilibrium networks that are mainly non-trivial. Unfortunately, this notion of pairwise stability requires coordinated action by pairs of decision makers in link formation. I survey the possible solutions in a purely non-cooperative framework of network formation under mutual consent by exploring potential refinements of the standard Nash equilibrium concept to explain the emergence of non-trivial networks. This includes the notions of unilateral and monadic stability. The first one is founded on advanced rational reasoning of individuals about how others would respond to one's efforts to modify the network. The latter incorporates trusting, boundedly rational behaviour into the network formation process. The survey is concluded with an initial exploration of external correlation devices as an alternative framework to address mutual consent in network formation.

Suggested Citation

  • Robert P. Gilles, 2019. "Building social networks under consent: A survey," Papers 1910.11693, arXiv.org, revised Apr 2020.
  • Handle: RePEc:arx:papers:1910.11693
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1910.11693
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Herings, P. Jean-Jacques & Mauleon, Ana & Vannetelbosch, Vincent, 2009. "Farsightedly stable networks," Games and Economic Behavior, Elsevier, vol. 67(2), pages 526-541, November.
    2. Dutta, Bhaskar & Ghosal, Sayantan & Ray, Debraj, 2005. "Farsighted network formation," Journal of Economic Theory, Elsevier, vol. 122(2), pages 143-164, June.
    3. Paul Seabright, 2010. "The Company of Strangers: A Natural History of Economic Life Revised Edition," Economics Books, Princeton University Press, edition 1, number 9169.
    4. Gilles, Robert P. & Sarangi, Sudipta, 2010. "Network formation under mutual consent and costly communication," Mathematical Social Sciences, Elsevier, vol. 60(3), pages 181-185, November.
    5. Subhadip Chakrabarti & Robert Gilles, 2007. "Network potentials," Review of Economic Design, Springer;Society for Economic Design, vol. 11(1), pages 13-52, June.
    6. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    7. Ben Golub & Yair Livne, 2010. "Strategic Random Networks," Working Papers 10-21, NET Institute.
    Full references (including those not matched with items on IDEAS)

    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. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    2. 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.
    3. Gilles, Robert P. & Chakrabarti, Subhadip & Sarangi, Sudipta, 2012. "Nash equilibria of network formation games under consent," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 159-165.
    4. Chenghong Luo & Ana Mauleon & Vincent Vannetelbosch, 2022. "Coalition-proof stable networks," Review of Economic Design, Springer;Society for Economic Design, vol. 26(2), pages 185-209, June.
    5. Carayol, Nicolas & Delille, Rémy & Vannetelbosch, Vincent, 2015. "Allocating value among farsighted players in network formation," Economics Letters, Elsevier, vol. 137(C), pages 50-53.
    6. Youngsub Chun & Sunghoon Hong & Bong Chan Koh, 2017. "Population invariance properties of social and economic networks," International Journal of Economic Theory, The International Society for Economic Theory, vol. 13(3), pages 255-267, September.
    7. Gilles, Robert P. & Sarangi, Sudipta, 2010. "Network formation under mutual consent and costly communication," Mathematical Social Sciences, Elsevier, vol. 60(3), pages 181-185, November.
    8. Mariya Teteryatnikova & James Tremewan, 2020. "Myopic and farsighted stability in network formation games: an experimental study," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 69(4), pages 987-1021, June.
    9. Olaizola, Norma & Valenciano, Federico, 2015. "Unilateral vs. bilateral link-formation: A transition without decay," Mathematical Social Sciences, Elsevier, vol. 74(C), pages 13-28.
    10. 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.
    11. Kirchsteiger, Georg & Mantovani, Marco & Mauleon, Ana & Vannetelbosch, Vincent, 2016. "Limited farsightedness in network formation," Journal of Economic Behavior & Organization, Elsevier, vol. 128(C), pages 97-120.
    12. Takako Fujiwara-Greve & Toru Hokari, 2023. "Farsighted Clustering with Group-Size Effects and Reputations," Dynamic Games and Applications, Springer, vol. 13(2), pages 610-635, June.
    13. HERINGS, P. Jean-Jacques & MAULEON, Ana & VANNETELBOSCH, Vincent, 2014. "Stability of networks under level-K farsightedness," LIDAM Discussion Papers CORE 2014032, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    14. 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.
    15. 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.
    16. Britta Hoyer & Kris De Jaegher, 2023. "Network disruption and the common-enemy effect," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 117-155, March.
    17. Bayer, Péter & Herings, P. Jean-Jacques & Peeters, Ronald, 2021. "Farsighted manipulation and exploitation in networks," Journal of Economic Theory, Elsevier, vol. 196(C).
    18. Ray, Debraj & Vohra, Rajiv, 2015. "Coalition Formation," Handbook of Game Theory with Economic Applications,, Elsevier.
    19. P. Jean-Jacques Herings & Ana Mauleon & Vincent Vannetelbosch, 2021. "Horizon- K Farsightedness in Criminal Networks," Games, MDPI, vol. 12(3), pages 1-13, July.
    20. Bedayo, Mikel & Mauleon, Ana & Vannetelbosch, Vincent, 2016. "Bargaining in endogenous trading networks," Mathematical Social Sciences, Elsevier, vol. 80(C), pages 70-82.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:1910.11693. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.