IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/29755.html
   My bibliography  Save this paper

On the number of blocks required to access the coalition structure core

Author

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

Abstract

This article shows that, for any transferable utility game in coalitional form with 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*n+4n)/4, where n is the cardinality of the player set. This number considerably improves the upper bound found so far by Koczy and Lauwers (2004).

Suggested Citation

  • 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.
    • Handle: RePEc:pra:mprapa:29755
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/29755/1/MPRA_paper_29755.pdf
    File Function: original version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sengupta, Abhijit & Sengupta, Kunal, 1996. "A Property of the Core," Games and Economic Behavior, Elsevier, vol. 12(2), pages 266-273, February.
    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. 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.
    4. Koczy, Laszlo A. & Lauwers, Luc, 2004. "The coalition structure core is accessible," Games and Economic Behavior, Elsevier, vol. 48(1), pages 86-93, July.
    5. 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.
    6. Greenberg, Joseph, 1994. "Coalition structures," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 2, chapter 37, pages 1305-1337, Elsevier.
    7. Robert Aumann, 2010. "Some non-superadditive games, and their Shapley values, in the Talmud," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 3-10, March.
    8. Yang, Yi-You, 2010. "On the accessibility of the core," Games and Economic Behavior, Elsevier, vol. 69(1), pages 194-199, May.
    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. Peter Biro & Matthijs Bomhoff & Walter Kern & Petr A. Golovach & Daniel Paulusma, 2012. "Solutions for the Stable Roommates Problem with Payments," CERS-IE WORKING PAPERS 1211, Institute of Economics, Centre for Economic and Regional Studies.
    2. 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.
    3. 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.

    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. Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.
    2. Yi-You Yang, 2020. "On the characterizations of viable proposals," Theory and Decision, Springer, vol. 89(4), pages 453-469, November.
    3. 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.
    4. László Á. Kóczy, 2018. "Partition Function Form Games," Theory and Decision Library C, Springer, number 978-3-319-69841-0, March.
    5. 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.
    6. 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.
    7. Koczy, Laszlo A. & Lauwers, Luc, 2007. "The minimal dominant set is a non-empty core-extension," Games and Economic Behavior, Elsevier, vol. 61(2), pages 277-298, November.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Yang, Yi-You, 2012. "On the accessibility of core-extensions," Games and Economic Behavior, Elsevier, vol. 74(2), pages 687-698.
    13. 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.
    14. 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.
    15. Koczy, Laszlo A. & Lauwers, Luc, 2004. "The coalition structure core is accessible," Games and Economic Behavior, Elsevier, vol. 48(1), pages 86-93, July.
    16. 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.
    17. 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.
    18. 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.
    19. Cesco, Juan Carlos, 2008. "A general characterization for non-balanced games in terms of U-cycles," European Journal of Operational Research, Elsevier, vol. 191(2), pages 409-415, December.
    20. Yang, Yi-You, 2010. "On the accessibility of the core," Games and Economic Behavior, Elsevier, vol. 69(1), pages 194-199, May.

    More about this item

    Keywords

    coalition structure core; excess function; payoff configuration; outsider independent domination.;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:pra:mprapa:29755. 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: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.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.