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

Efficient partnership formation in networks

Author

Listed:
  • Francis Bloch

    (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, 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 - INRA - Institut National de la Recherche Agronomique - EHESS - École des hautes études en sciences sociales - ENPC - École nationale des ponts et chaussées - CNRS - Centre National de la Recherche Scientifique)

  • Bhaskar Dutta

    (University of Warwick [Coventry])

  • Mihai Manea

    (SBU - Stony Brook University [SUNY] - SUNY - State University of New York)

Abstract

We analyze the formation of partnerships in social networks. Players need favors at random times and ask their neighbors in the network to form exclusive long‐term partnerships that guarantee reciprocal favor exchange. Refusing to provide a favor results in the automatic removal of the underlying link. Players agree to provide the first favor in a partnership only if they otherwise face the risk of eventual isolation. In equilibrium, players essential for realizing every maximum matching can avoid this risk and enjoy higher payoffs than inessential players. Although the search for partners is decentralized and reflects local partnership opportunities, the strength of essential players drives efficient partnership formation in every network. Equilibrium behavior is determined by the classification of nodes in the Gallai–Edmonds decomposition of the underlying network.

Suggested Citation

  • Francis Bloch & Bhaskar Dutta & Mihai Manea, 2019. "Efficient partnership formation in networks," Post-Print halshs-02302021, HAL.
    • Handle: RePEc:hal:journl:halshs-02302021
    DOI: 10.3982/TE3453
    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. Oguzhan Celebi, 2023. "Substitutability in Favor Exchange," Papers 2309.10749, arXiv.org.
    2. Alejandro Francetich, 2023. "When partner knows best: asymmetric expertise in partnerships," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(2), pages 363-399, June.
    3. Darpoe, Erik & Dominguez, Alvaro & Martin-Rodriguez, Maria, "undated". "Bargaining Dynamics and Varied Linking Costs in Stable Networks," AGI Working Paper Series 2024-04, Asian Growth Research Institute.
    4. Zhiwei Cui & Yan-An Hwang & Ding-Cheng You, 2021. "Axiomatizations of the $$\beta $$ β and the score measures in networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(2), pages 399-418, June.
    5. Yazıcı, Ayşe, 2022. "Decentralized matching at senior-level: Stability and incentives," Journal of Mathematical Economics, Elsevier, vol. 101(C).
    6. Ayse Yazici, 2022. "Decentralized Matching at Senior-Level: Stability and Incentives," Department of Economics Working Papers 2022_01, Durham University, Department of Economics.

    More about this item

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • 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:hal:journl:halshs-02302021. 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.