IDEAS home Printed from https://ideas.repec.org/p/hal/wpaper/halshs-01432953.html

The formation of partnerships in social networks

Author

Listed:
  • Francis Bloch

    (PJSE - Paris Jourdan Sciences Economiques - 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 nationale des ponts et chaussées - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement, 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 nationale des ponts et chaussées - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)

  • Bhaskar Dutta

    (University of Warwick [Coventry])

  • Stéphane Robin

    (GATE Lyon Saint-Étienne - Groupe d'Analyse et de Théorie Economique Lyon - Saint-Etienne - ENS de Lyon - École normale supérieure de Lyon - Université de Lyon - UL2 - Université Lumière - Lyon 2 - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon - UJM - Université Jean Monnet - Saint-Étienne - CNRS - Centre National de la Recherche Scientifique)

  • Min Zhu

    (BNU - Beijing Normal University)

Abstract

This paper analyzes the formation of partnerships in social networks. Agents randomly request favors and turn to their neighbors to form a partnership. If favors are costly, agents have an incentive to delay the formation of the partnership. In that case, for any initial social network, the unique Markov Perfect equilibrium results in the formation of the maximum number of partnerships when players become infinitely patient. If favors provide benefits, agents rush to form partnerships at the cost of disconnecting other agents and the only perfect initial networks for which the maximum number of partnerships are formed are the complete and complete bipartite networks. The theoretical model is tested in the lab. Subjects generally play according to their equilibrium strategy and the efficient outcome is obtained over 78% of the times. Decisions are affected by the complexity of the network. Two behavioral rules are observed during the experiment: subjects accept the formation of the partnership too often and reject partnership offers when one of their neighbors is only connected to them.

Suggested Citation

  • Francis Bloch & Bhaskar Dutta & Stéphane Robin & Min Zhu, 2017. "The formation of partnerships in social networks," Working Papers halshs-01432953, HAL.
    • Handle: RePEc:hal:wpaper:halshs-01432953
    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
    for a similarly titled item that would be available.

    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. Bloch, Francis & Dutta, Bhaskar & Manea, Mihai, 2019. "Efficient partnership formation in networks," Theoretical Economics, Econometric Society, vol. 14(3), July.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    JEL classification:

    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:wpaper:halshs-01432953. 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: 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.