IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/3207.html

Coalition-proof stable networks

Author

Listed:
  • Luo, Chenghong

    (Ca’ Foscari University of Venice)

  • Mauleon, Ana

    (Université catholique de Louvain, LIDAM/CORE, Belgium)

  • Vannetelbosch, Vincent

    (Université catholique de Louvain, LIDAM/CORE, Belgium)

Abstract

We propose the notion of coalition-proof stability for predicting the networks that could emerge when group deviations are allowed. A network is coalition-proof stable if there exists no coalition which has a credible group deviation. A coalition is said to have a credible group deviation if there is a profitable group deviation to some network and there is no subcoalition of the deviating players which has a subsequent credible group deviation. Coalition-proof stability is a coarsening of strong stability. We emphasize the importance of coalition-proof stability by considering four models where a strongly stable network fails to exist while a coalition-proof stable network does exist. We provide an easy to verify condition for the existence of a coalition-proof stable network while a strongly stable network may not exist. There is no relationship between the set of coalition-proof stable networks and the set of networks induced by a coalition-proof Nash equilibrium of Myerson’s linking game.

Suggested Citation

  • Luo, Chenghong & Mauleon, Ana & Vannetelbosch, Vincent, 2022. "Coalition-proof stable networks," LIDAM Reprints CORE 3207, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:3207
    DOI: https://doi.org/10.1007/s10058-021-00264-5
    Note: In: Review of Economic Design, 2022, vol. 26, p. 185-209
    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. Pierre de Callataÿ & Ana Mauleon & Vincent Vannetelbosch, 2024. "Local farsightedness in network formation," International Journal of Economic Theory, The International Society for Economic Theory, vol. 20(2), pages 199-226, June.
    2. Hosseinzadeh Ranjbar, Homa & Feizi, Mehdi, 2025. "Credibility of group manipulation in random assignments," Games and Economic Behavior, Elsevier, vol. 150(C), pages 27-33.
    3. Bravard, Christophe & Sarangi, Sudipta & Tzavellas, Hector, 2025. "Group dominant networks and convexity," Journal of Mathematical Economics, Elsevier, vol. 118(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • A14 - General Economics and Teaching - - General Economics - - - Sociology of Economics
    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
    • D20 - Microeconomics - - Production and Organizations - - - 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:cor:louvrp:3207. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.