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

Farsighted Coalitional Stability in TU-Games

Author

Listed:
  • Sylvain Béal

    (CREUSET - Centre de Recherche Economique de l'Université de Saint-Etienne - UJM - Université Jean Monnet - Saint-Étienne)

  • Jacques Durieu

    (CREUSET - Centre de Recherche Economique de l'Université de Saint-Etienne - UJM - Université Jean Monnet - Saint-Étienne)

  • Philippe Solal

    (CREUSET - Centre de Recherche Economique de l'Université de Saint-Etienne - UJM - Université Jean Monnet - Saint-Étienne)

Abstract

We study farsighted coalitional stability in the context of TUgames. Chwe (1994, p.318) notes that, in this context, it is difficult to prove nonemptiness of the largest consistent set. We show that every TU-game has a nonempty largest consistent set. Moreover, the proof of this result points out that each TU-game has a farsighted stable set. We go further by providing a characterization of the collection of farsighted stable sets in TU-games. We also show that the farsighted core of a TU-game is empty or is equal to the set of imputations of the game. Next, the relationships between the core and the largest consistent set are studied in superadditive TU-games and in clan games. In the last section, we explore the stability of the Shapley value. It is proved that the Shapley value of a superadditive TU-game is always a stable imputation: it is a core imputation or it constitutes a farsighted stable set. A necessary and sufficient condition for a superadditive TU-game to have the Shapley value in the largest consistent set is given.
(This abstract was borrowed from another version of this item.)
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Sylvain Béal & Jacques Durieu & Philippe Solal, 2007. "Farsighted Coalitional Stability in TU-Games," Post-Print ujm-00176491, HAL.
    • Handle: RePEc:hal:journl:ujm-00176491
    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. is not listed on IDEAS
    2. Kimya, Mert, 2020. "Equilibrium coalitional behavior," Theoretical Economics, Econometric Society, vol. 15(2), May.
    3. Ray, Debraj & Vohra, Rajiv, 2015. "Coalition Formation," Handbook of Game Theory with Economic Applications,, Elsevier.
    4. Xiaozhou Xu & Shenle Pan & Eric Ballot, 2012. "Allocation of Transportation Cost & CO2 Emission in Pooled Supply Chains Using Cooperative Game Theory," Post-Print hal-00733491, HAL.
    5. Debraj Ray & Rajiv Vohra, 2015. "The Farsighted Stable Set," Econometrica, Econometric Society, vol. 83(3), pages 977-1011, May.
    6. Gedai, Endre & Kóczy, László Á. & Zombori, Zita, 2012. "Cluster games: A novel, game theory-based approach to better understand incentives and stability in clusters," MPRA Paper 65095, University Library of Munich, Germany.
    7. Toshiyuki Hirai, 2018. "Single-payoff farsighted stable sets in strategic games with dominant punishment strategies," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(4), pages 1087-1111, November.
    8. Kawasaki, Ryo, 2015. "Maximin, minimax, and von Neumann–Morgenstern farsighted stable sets," Mathematical Social Sciences, Elsevier, vol. 74(C), pages 8-12.
    9. Anindya Bhattacharya & Victoria Brosi, 2011. "An existence result for farsighted stable sets of games in characteristic function form," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 393-401, May.
    10. Shino, Junnosuke & Kawasaki, Ryo, 2012. "Farsighted stable sets in Hotelling’s location games," Mathematical Social Sciences, Elsevier, vol. 63(1), pages 23-30.
    11. Aivazian, Varouj A. & Callen, Jeffrey L., 2023. "The Coase Theorem and the empty core: Inspecting the entrails after four decades," International Review of Law and Economics, Elsevier, vol. 73(C).
    12. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2010. "On the number of blocks required to access the core," MPRA Paper 26578, University Library of Munich, Germany.
    13. Alphonse Fodouop Fotso & Roland Pongou & Bertrand Tchantcho, 2024. "A Behavioral Test and Classification of Solution Concepts in Games," SN Operations Research Forum, Springer, vol. 5(4), pages 1-35, December.
    14. Talamàs, Eduard, 2018. "Fair stable sets of simple games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 574-584.
    15. Kawasaki, Ryo & Sato, Takashi & Muto, Shigeo, 2015. "Farsightedly stable tariffs," Mathematical Social Sciences, Elsevier, vol. 76(C), pages 118-124.

    More about this item

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • 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:hal:journl:ujm-00176491. 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.