IDEAS home Printed from https://ideas.repec.org/p/has/discpr/1512.html
   My bibliography  Save this paper

Universal Characterization Sets for the Nucleolus in Balanced Games

Author

Listed:
  • Tamas Solymosi

    (Momentum Game Theory Research Group, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences)

  • Balazs Sziklai

    (Momentum Game Theory Research Group, Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences)

Abstract

We provide a new modus operandi for the computation of the nucleolus in cooperative games with transferable utility. Using the concept of dual game we extend the theory of characterization sets. Dually essential and dually saturated coalitions determine both the core and the nucleolus in monotonic games whenever the core is non-empty. We show how these two sets are related with the existing characterization sets. In particular we prove that if the grand coalition is vital then the intersection of essential and dually essential coalitions forms a characterization set itself. We conclude with a sample computation of the nucleolus of bankruptcy games - the shortest of its kind.

Suggested Citation

  • Tamas Solymosi & Balazs Sziklai, 2015. "Universal Characterization Sets for the Nucleolus in Balanced Games," CERS-IE WORKING PAPERS 1512, Institute of Economics, Centre for Economic and Regional Studies.
  • Handle: RePEc:has:discpr:1512
    as

    Download full text from publisher

    File URL: http://econ.core.hu/file/download/mtdp/MTDP1512.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Tamás Fleiner & Balázs Sziklai, 2012. "The Nucleolus Of The Bankruptcy Problem By Hydraulic Rationing," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 14(01), pages 1-11.
    2. Groote Schaarsberg, M. & Borm, P.E.M. & Hamers, H.J.M. & Reijnierse, J.H., 2012. "Interactive Purchasing Situations," Discussion Paper 2012-035, Tilburg University, Center for Economic Research.
    3. Rodica Brânzei & Tamás Solymosi & Stef Tijs, 2005. "Strongly essential coalitions and the nucleolus of peer group games," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(3), pages 447-460, September.
    4. Thomson, William, 2015. "Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: An update," Mathematical Social Sciences, Elsevier, vol. 74(C), pages 41-59.
    5. D. Granot & F. Granot & W. R. Zhu, 1998. "Characterization sets for the nucleolus," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(3), pages 359-374.
    6. Sankaran, Jayaram K, 1991. "On Finding the Nucleolus of an N-Person Cooperative Game," International Journal of Game Theory, Springer;Game Theory Society, vol. 19(4), pages 329-338.
    7. Jeroen Kuipers & Ulrich Faigle & Walter Kern, 1998. "Note Computing the nucleolus of min-cost spanning tree games is NP-hard," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(3), pages 443-450.
    8. Maschler, M. & Potters, J.A.M. & Tijs, S.H., 1992. "The general nucleolus and the reduced game property," Other publications TiSEM ab187dab-1b5b-40c3-a673-8, Tilburg University, School of Economics and Management.
    9. 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.
    10. Rodica Brânzei & Elena Iñarra & Stef Tijs & José Zarzuelo, 2006. "A Simple Algorithm for the Nucleolus of Airport Profit Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 34(2), pages 259-272, August.
    11. Granot, Daniel & Hamers, Herbert & Kuipers, Jeroen & Maschler, Michael, 2011. "On Chinese postman games where residents of each road pay the cost of their road," Games and Economic Behavior, Elsevier, vol. 72(2), pages 427-438, June.
    12. SCHMEIDLER, David, 1969. "The nucleolus of a characteristic function game," LIDAM Reprints CORE 44, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. Maschler, M & Potters, J A M & Tijs, S H, 1992. "The General Nucleolus and the Reduced Game Property," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(1), pages 85-106.
    14. Solymosi, Tamas & Raghavan, Tirukkannamangai E S, 1994. "An Algorithm for Finding the Nucleolus of Asignment Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 23(2), pages 119-143.
    15. Aumann, Robert J. & Maschler, Michael, 1985. "Game theoretic analysis of a bankruptcy problem from the Talmud," Journal of Economic Theory, Elsevier, vol. 36(2), pages 195-213, August.
    16. Walter Kern & Daniël Paulusma, 2003. "Matching Games: The Least Core and the Nucleolus," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 294-308, May.
    17. S. C. Littlechild & G. Owen, 1973. "A Simple Expression for the Shapley Value in a Special Case," Management Science, INFORMS, vol. 20(3), pages 370-372, November.
    18. M. Maschler & B. Peleg & L. S. Shapley, 1979. "Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 303-338, November.
    19. Michael Maschler & Jos Potters & Hans Reijnierse, 2010. "The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 89-104, March.
    20. Fromen, Bastian, 1997. "Reducing the number of linear programs needed for solving the nucleolus problem of n-person game theory," European Journal of Operational Research, Elsevier, vol. 98(3), pages 626-636, 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. Márton Benedek & Jörg Fliege & Tri-Dung Nguyen, 2020. "Finding and verifying the nucleolus of cooperative games," CERS-IE WORKING PAPERS 2021, Institute of Economics, Centre for Economic and Regional Studies.
    2. Hougaard, Jens Leth & Smilgins, Aleksandrs, 2016. "Risk capital allocation with autonomous subunits: The Lorenz set," Insurance: Mathematics and Economics, Elsevier, vol. 67(C), pages 151-157.
    3. Bruce C. Hartman, 2018. "Sharing Loading Costs for Multi Compartment Vehicles," Games, MDPI, vol. 9(2), pages 1-21, 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. Xiaotie Deng & Qizhi Fang & Xiaoxun Sun, 2009. "Finding nucleolus of flow game," Journal of Combinatorial Optimization, Springer, vol. 18(1), pages 64-86, July.
    2. Márton Benedek & Jörg Fliege & Tri-Dung Nguyen, 2020. "Finding and verifying the nucleolus of cooperative games," CERS-IE WORKING PAPERS 2021, Institute of Economics, Centre for Economic and Regional Studies.
    3. repec:has:discpr:1321 is not listed on IDEAS
    4. Vijay V. Vazirani, 2022. "New Characterizations of Core Imputations of Matching and $b$-Matching Games," Papers 2202.00619, arXiv.org, revised Dec 2022.
    5. Tamás Solymosi, 2019. "Weighted nucleoli and dually essential coalitions (extended version)," CERS-IE WORKING PAPERS 1914, Institute of Economics, Centre for Economic and Regional Studies.
    6. Tamás Solymosi, 2019. "Weighted nucleoli and dually essential coalitions," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(4), pages 1087-1109, December.
    7. Vazirani, Vijay V., 2022. "The general graph matching game: Approximate core," Games and Economic Behavior, Elsevier, vol. 132(C), pages 478-486.
    8. Rodica Brânzei & Tamás Solymosi & Stef Tijs, 2005. "Strongly essential coalitions and the nucleolus of peer group games," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(3), pages 447-460, September.
    9. Potters, Jos & Sudholter, Peter, 1999. "Airport problems and consistent allocation rules," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 83-102, July.
    10. Qizhi Fang & Bo Li & Xiaohan Shan & Xiaoming Sun, 2018. "Path cooperative games," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 211-229, July.
    11. A. Estévez-Fernández & P. Borm & M. G. Fiestras-Janeiro & M. A. Mosquera & E. Sánchez-Rodríguez, 2017. "On the 1-nucleolus," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(2), pages 309-329, October.
      • Estévez-Fernández , M.A. & Borm, Peter & Fiestras, & Mosquera, & Sanchez,, 2017. "On the 1-nucleolus," Other publications TiSEM a8ce6687-c87a-4131-98f7-3, Tilburg University, School of Economics and Management.
    12. D. Granot & H. Hamers & J. Kuipers & M. Maschler, 2004. "Chinese Postman Games on a Class of Eulerian Graphs," Discussion Paper Series dp366, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    13. Nguyen, Tri-Dung & Thomas, Lyn, 2016. "Finding the nucleoli of large cooperative games," European Journal of Operational Research, Elsevier, vol. 248(3), pages 1078-1092.
    14. Walter Kern & Daniël Paulusma, 2003. "Matching Games: The Least Core and the Nucleolus," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 294-308, May.
    15. Slikker, Marco & Norde, Henk, 2011. "The monoclus of a coalitional game," Games and Economic Behavior, Elsevier, vol. 71(2), pages 420-435, March.
    16. Csóka, Péter & Jean-Jacques Herings, P., 2019. "Liability games," Games and Economic Behavior, Elsevier, vol. 116(C), pages 260-268.
    17. Gustavo Bergantiños & Juan Vidal-Puga, 2021. "A review of cooperative rules and their associated algorithms for minimum-cost spanning tree problems," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 12(1), pages 73-100, March.
    18. Elena Iñarra & Roberto Serrano & Ken-Ichi Shimomura, 2020. "The Nucleolus, the Kernel, and the Bargaining Set: An Update," Revue économique, Presses de Sciences-Po, vol. 71(2), pages 225-266.
    19. Quant, Marieke & Borm, Peter & Hendrickx, Ruud & Zwikker, Peter, 2006. "Compromise solutions based on bankruptcy," Mathematical Social Sciences, Elsevier, vol. 51(3), pages 247-256, May.
    20. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    21. Fatemeh Babaei & Hamidreza Navidi & Stefano Moretti, 2022. "A bankruptcy approach to solve the fixed cost allocation problem in transport systems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(2), pages 332-358, July.

    More about this item

    Keywords

    Cooperative game theory; Nucleolus; Characterization sets;
    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:has:discpr:1512. 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: Nora Horvath (email available below). General contact details of provider: https://edirc.repec.org/data/iehashu.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.