IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v78y2013i2p187-202.html
   My bibliography  Save this article

Accessibility and stability of the coalition structure core

Author

Listed:
  • Sylvain Béal
  • Eric Rémila
  • Philippe Solal

Abstract

This article shows that, for any transferable utility game in coalitional form with a nonempty coalition structure core, the number of steps required to switch from a payoff configuration out of the coalition structure core to a payoff configuration in the coalition structure core is less than or equal to $$(n^2+4n)/4$$ , where $$n$$ is the cardinality of the player set. This number improves the upper bounds found so far. We also provide a sufficient condition for the stability of the coalition structure core, i.e. a condition which ensures the accessibility of the coalition structure core in one step. On the class of simple games, this sufficient condition is also necessary and has a meaningful interpretation. Copyright Springer-Verlag Berlin Heidelberg 2013

Suggested Citation

  • Sylvain Béal & Eric Rémila & Philippe Solal, 2013. "Accessibility and stability of the coalition structure core," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(2), pages 187-202, October.
    • Handle: RePEc:spr:mathme:v:78:y:2013:i:2:p:187-202
    DOI: 10.1007/s00186-013-0439-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-013-0439-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-013-0439-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2013. "An optimal bound to access the core in TU-games," Games and Economic Behavior, Elsevier, vol. 80(C), pages 1-9.
    2. Sengupta, Abhijit & Sengupta, Kunal, 1994. "Viable Proposals," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 35(2), pages 347-359, May.
    3. R.J. Aumann & S. Hart (ed.), 2002. "Handbook of Game Theory with Economic Applications," Handbook of Game Theory with Economic Applications, Elsevier, edition 1, volume 3, number 3.
    4. 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.
    5. van Velzen, Bas & Hamers, Herbert & Solymosi, Tamas, 2008. "Core stability in chain-component additive games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 116-139, January.
    6. Koczy, Laszlo A. & Lauwers, Luc, 2004. "The coalition structure core is accessible," Games and Economic Behavior, Elsevier, vol. 48(1), pages 86-93, July.
    7. Koczy, Laszlo A., 2006. "The core can be accessed with a bounded number of blocks," Journal of Mathematical Economics, Elsevier, vol. 43(1), pages 56-64, December.
    8. Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.
    9. Thomas Bietenhader & Yoshio Okamoto, 2006. "Core Stability of Minimum Coloring Games," Mathematics of Operations Research, INFORMS, vol. 31(2), pages 418-431, May.
    10. Shellshear, Evan & Sudhölter, Peter, 2009. "On core stability, vital coalitions, and extendability," Games and Economic Behavior, Elsevier, vol. 67(2), pages 633-644, November.
    11. Vincent Feltkamp & Javier Arin, 1997. "The Nucleolus and Kernel of Veto-Rich Transferable Utility Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 26(1), pages 61-73.
    12. Yang, Yi-You, 2010. "On the accessibility of the core," Games and Economic Behavior, Elsevier, vol. 69(1), pages 194-199, May.
    13. Kamal Jain & Rakesh Vohra, 2010. "Extendability and von Neuman–Morgenstern stability of the core," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(4), pages 691-697, October.
    14. Amit K. Biswas & G. Ravindran & T. Parthasarathy, 2000. "Stability and largeness of core for symmetric games," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(1), pages 11-22.
    15. T. E. S. Raghavan & Tamás Solymosi, 2001. "Assignment games with stable core," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(2), pages 177-185.
    16. Manea, Mihai, 2007. "Core tatonnement," Journal of Economic Theory, Elsevier, vol. 133(1), pages 331-349, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Péter Szikora, 2013. "Introduction into the literature of cooperative game theory with special emphasis on dynamic games and the core," Proceedings- 11th International Conference on Mangement, Enterprise and Benchmarking (MEB 2013),, Óbuda University, Keleti Faculty of Business and Management.
    2. Mauleon, Ana & Roehl, Nils & Vannetelbosch, Vincent, 2019. "Paths to stability for overlapping group structures," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 19-24.
    3. Bando, Keisuke & Kawasaki, Ryo, 2021. "Stability properties of the core in a generalized assignment problem," Games and Economic Behavior, Elsevier, vol. 130(C), pages 211-223.
    4. Herings, P. Jean-Jacques & Kóczy, László Á., 2021. "The equivalence of the minimal dominant set and the myopic stable set for coalition function form games," Games and Economic Behavior, Elsevier, vol. 127(C), pages 67-79.
    5. Yi-You Yang, 2020. "On the characterizations of viable proposals," Theory and Decision, Springer, vol. 89(4), pages 453-469, November.

    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. Yi-You Yang, 2020. "On the characterizations of viable proposals," Theory and Decision, Springer, vol. 89(4), pages 453-469, November.
    2. Herings, P. Jean-Jacques & Kóczy, László Á., 2021. "The equivalence of the minimal dominant set and the myopic stable set for coalition function form games," Games and Economic Behavior, Elsevier, vol. 127(C), pages 67-79.
    3. Bando, Keisuke & Kawasaki, Ryo, 2021. "Stability properties of the core in a generalized assignment problem," Games and Economic Behavior, Elsevier, vol. 130(C), pages 211-223.
    4. László Á. Kóczy, 2018. "Partition Function Form Games," Theory and Decision Library C, Springer, number 978-3-319-69841-0, March.
    5. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2013. "An optimal bound to access the core in TU-games," Games and Economic Behavior, Elsevier, vol. 80(C), pages 1-9.
    6. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2011. "On the number of blocks required to access the coalition structure core," MPRA Paper 29755, University Library of Munich, Germany.
    7. Péter Szikora, 2013. "Introduction into the literature of cooperative game theory with special emphasis on dynamic games and the core," Proceedings- 11th International Conference on Mangement, Enterprise and Benchmarking (MEB 2013),, Óbuda University, Keleti Faculty of Business and Management.
    8. Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.
    9. Mauleon, Ana & Roehl, Nils & Vannetelbosch, Vincent, 2019. "Paths to stability for overlapping group structures," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 19-24.
    10. 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.
    11. 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.
    12. Péter Szikora, 2012. "Dynamic cooperative models of coalition formation and the core," Proceedings- 10th International Conference on Mangement, Enterprise and Benchmarking (MEB 2012),, Óbuda University, Keleti Faculty of Business and Management.
    13. Péter Biró & Gethin Norman, 2013. "Analysis of stochastic matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(4), pages 1021-1040, November.
    14. Hirai, Toshiyuki & Watanabe, Naoki, 2018. "von Neumann–Morgenstern stable sets of a patent licensing game: The existence proof," Mathematical Social Sciences, Elsevier, vol. 94(C), pages 1-12.
    15. Yang, Yi-You, 2012. "On the accessibility of core-extensions," Games and Economic Behavior, Elsevier, vol. 74(2), pages 687-698.
    16. Szikora Péter, 2011. "Tanítás értelmezhetõ-e, mint egy kooperatív dinamikus játék?," Proceedings- 9th International Conference on Mangement, Enterprise and Benchmarking (MEB 2011),, Óbuda University, Keleti Faculty of Business and Management.
    17. Péter Szikora, 2010. "A comparison of dynamic cooperative models of coalition formation," Proceedings-8th International Conference on Mangement,Enterprise and Benchmarking (MEB 2010),, Óbuda University, Keleti Faculty of Business and Management.
    18. van Velzen, S., 2005. "Simple Combinatorial Optimisation Cost Games," Discussion Paper 2005-118, Tilburg University, Center for Economic Research.
    19. Bolle Friedel & Otto Philipp E., 2016. "Matching as a Stochastic Process," Journal of Economics and Statistics (Jahrbuecher fuer Nationaloekonomie und Statistik), De Gruyter, vol. 236(3), pages 323-348, May.
    20. Koczy, Laszlo A., 2006. "The core can be accessed with a bounded number of blocks," Journal of Mathematical Economics, Elsevier, vol. 43(1), pages 56-64, December.

    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:spr:mathme:v:78:y:2013:i:2:p:187-202. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.