IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-00945317.html
   My bibliography  Save this paper

An optimal bound to access the core in TU-games

Author

Listed:
  • Sylvain Béal

    (GATE Lyon Saint-Étienne - Groupe d'Analyse et de Théorie Economique Lyon - Saint-Etienne - ENS de Lyon - École normale supérieure de Lyon - Université de Lyon - UL2 - Université Lumière - Lyon 2 - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon - UJM - Université Jean Monnet - Saint-Étienne - CNRS - Centre National de la Recherche Scientifique, CRESE - Centre de REcherches sur les Stratégies Economiques (UR 3190) - UFC - Université de Franche-Comté - UBFC - Université Bourgogne Franche-Comté [COMUE])

  • Éric Rémila

    (GATE Lyon Saint-Étienne - Groupe d'Analyse et de Théorie Economique Lyon - Saint-Etienne - ENS de Lyon - École normale supérieure de Lyon - Université de Lyon - UL2 - Université Lumière - Lyon 2 - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon - UJM - Université Jean Monnet - Saint-Étienne - CNRS - Centre National de la Recherche Scientifique, LIP - Laboratoire de l'Informatique du Parallélisme - ENS de Lyon - École normale supérieure de Lyon - Université de Lyon - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon - Inria - Institut National de Recherche en Informatique et en Automatique - Université de Lyon - CNRS - Centre National de la Recherche Scientifique)

  • Philippe Solal

    (GATE Lyon Saint-Étienne - Groupe d'Analyse et de Théorie Economique Lyon - Saint-Etienne - ENS de Lyon - École normale supérieure de Lyon - Université de Lyon - UL2 - Université Lumière - Lyon 2 - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon - UJM - Université Jean Monnet - Saint-Étienne - CNRS - Centre National de la Recherche Scientifique)

Abstract

We show that the core of any n-player TU-game with a non-empty core can be accessed with at most n−1 blocks. It turns out that this bound is optimal in the sense there are TU-games for which the number of blocks required to access the core is exactly n−1.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Sylvain Béal & Éric Rémila & Philippe Solal, 2013. "An optimal bound to access the core in TU-games," Post-Print halshs-00945317, HAL.
    • Handle: RePEc:hal:journl:halshs-00945317
    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 search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Peleg, B, 1986. "On the Reduced Game Property and Its Converse," International Journal of Game Theory, Springer;Game Theory Society, vol. 15(3), pages 187-200.
    2. 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.
    3. Yang, Yi-You, 2010. "On the accessibility of the core," Games and Economic Behavior, Elsevier, vol. 69(1), pages 194-199, May.
    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. Sengupta, Abhijit & Sengupta, Kunal, 1996. "A Property of the Core," Games and Economic Behavior, Elsevier, vol. 12(2), pages 266-273, February.
    6. Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.
    7. 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.
    8. 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.
    9. John C. Harsanyi, 1974. "An Equilibrium-Point Interpretation of Stable Sets and a Proposed Alternative Definition," Management Science, INFORMS, vol. 20(11), pages 1472-1495, July.
    10. 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.
    11. Ichiishi, Tatsuro, 1981. "Super-modularity: Applications to convex games and to the greedy algorithm for LP," Journal of Economic Theory, Elsevier, vol. 25(2), pages 283-286, October.
    12. Peleg, B, 1987. "On the Reduced Game Property and Its Converse: A Correction," International Journal of Game Theory, Springer;Game Theory Society, vol. 16(4), pages 290-290.
    13. Ray, Debraj, 1989. "Credible Coalitions and the Core," International Journal of Game Theory, Springer;Game Theory Society, vol. 18(2), pages 185-187.
    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. 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.
    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. 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.
    5. 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.

    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. László Á. Kóczy, 2018. "Partition Function Form Games," Theory and Decision Library C, Springer, number 978-3-319-69841-0, March.
    2. 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.
    3. 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.
    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. 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.
    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. Yi-You Yang, 2020. "On the characterizations of viable proposals," Theory and Decision, Springer, vol. 89(4), pages 453-469, November.
    9. Yang, Yi-You, 2011. "Accessible outcomes versus absorbing outcomes," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 65-70, July.
    10. Yang, Yi-You, 2012. "On the accessibility of core-extensions," Games and Economic Behavior, Elsevier, vol. 74(2), pages 687-698.
    11. Nunez, Marina & Rafels, Carles, 2003. "Characterization of the extreme core allocations of the assignment game," Games and Economic Behavior, Elsevier, vol. 44(2), pages 311-331, August.
    12. 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.
    13. Ray, Debraj & Vohra, Rajiv, 2015. "Coalition Formation," Handbook of Game Theory with Economic Applications,, Elsevier.
    14. Funaki, Y. & Tijs, S.H. & Brânzei, R., 2007. "Leximals, the Lexicore and the Average Lexicographic Value," Other publications TiSEM 405775ae-c634-49c5-9f9c-4, Tilburg University, School of Economics and Management.
    15. Bas Dietzenbacher & Elena Yanovskaya, 2021. "Consistency of the equal split-off set," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(1), pages 1-22, March.
    16. Debraj Ray & Rajiv Vohra, 2015. "The Farsighted Stable Set," Econometrica, Econometric Society, vol. 83(3), pages 977-1011, May.
    17. Bloch, Francis & de Clippel, Geoffroy, 2010. "Cores of combined games," Journal of Economic Theory, Elsevier, vol. 145(6), pages 2424-2434, November.
    18. Pierre Dehez, 2017. "On Harsanyi Dividends and Asymmetric Values," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 19(03), pages 1-36, September.
    19. Demuynck, Thomas & Rock, Bram De & Ginsburgh, Victor, 2016. "The transfer paradox in welfare space," Journal of Mathematical Economics, Elsevier, vol. 62(C), pages 1-4.
    20. 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.

    More about this item

    Keywords

    Core; TU-Games;

    JEL classification:

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

    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-00945317. 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: 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.