IDEAS home Printed from https://ideas.repec.org/p/hal/cesptp/halshs-00267933.html

A new approach to the core and Weber set of multichoice games

Author

Listed:
  • Michel Grabisch

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

  • Lijue Xie

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

Abstract

Multichoice games have been introduced by Hsiao and Raghavan as a generalization of classical cooperative games. An important notion in cooperative game theory is the core of the game, as it contains the rational imputations for players. We propose two definitions for the core of a multichoice game, the first one is called the precore and is a direct generalization of the classical definition. We show that the precore coincides with the definition proposed by Faigle, and that the set of imputations may be unbounded, which makes its application questionable. A second definition is proposed, imposing normalization at each level, causing the core to be a convex compact set. We study its properties, introducing balancedness and marginal worth vectors, and defining the Weber set and the pre-Weber set. We show that the classical properties of inclusion of the (pre)core into the (pre)-Weber set as well as their coincidence in the convex case remain valid. A last section makes a comparison with the core defined by van den Nouweland et al.

Suggested Citation

  • Michel Grabisch & Lijue Xie, 2007. "A new approach to the core and Weber set of multichoice games," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00267933, HAL.
  • Handle: RePEc:hal:cesptp:halshs-00267933
    DOI: 10.1007/s00186-007-0159-8
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00267933v1
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-00267933v1/document
    Download Restriction: no

    File URL: https://libkey.io/10.1007/s00186-007-0159-8?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
    ---><---

    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. Michel Grabisch, 2011. "Ensuring the boundedness of the core of games with restricted cooperation," Annals of Operations Research, Springer, vol. 191(1), pages 137-154, November.
    2. David Lowing & Makoto Yokoo, 2025. "Sharing values for multi-choice games: an axiomatic approach," International Journal of Game Theory, Springer;Game Theory Society, vol. 54(2), pages 1-32, December.
    3. Sylvain Béal & Adriana Navarro-Ramos & Eric Rémila & Philippe Solal, 2023. "Sharing the cost of hazardous transportation networks and the Priority Shapley value," Working Papers hal-04222245, HAL.
    4. Michel Grabisch & Lijue Xie, 2008. "The core of games on distributive lattices: how to share benefits in a hierarchy," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00344802, HAL.
    5. David Lowing & Kevin Techer, 2022. "Marginalism, egalitarianism and efficiency in multi-choice games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(4), pages 815-861, November.
    6. Michel Grabisch & Peter Sudhölter, 2016. "Characterizations of solutions for games with precedence constraints," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01297600, HAL.
    7. repec:hal:pseose:hal-01297600 is not listed on IDEAS
    8. Jin, Yuhui & Chang, Chuei-Tin & Li, Shaojun & Jiang, Da, 2018. "On the use of risk-based Shapley values for cost sharing in interplant heat integration programs," Applied Energy, Elsevier, vol. 211(C), pages 904-920.
    9. Michel Grabisch & Lijue Xie, 2011. "The restricted core of games on distributive lattices: how to share benefits in a hierarchy," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(2), pages 189-208, April.
    10. Branzei, R. & Tijs, S. & Zarzuelo, J., 2009. "Convex multi-choice games: Characterizations and monotonic allocation schemes," European Journal of Operational Research, Elsevier, vol. 198(2), pages 571-575, October.
    11. Techer, Kevin, 2021. "Stable agreements through liability rules: A multi-choice game approach to the social cost problem," Mathematical Social Sciences, Elsevier, vol. 111(C), pages 77-88.
    12. David Lowing & Kevin Techer, 2021. "Marginalism, Egalitarianism and E ciency in Multi-Choice Games," Working Papers halshs-03334056, HAL.
    13. Lowing, David, 2024. "Cost allocation in energy distribution networks," Journal of Mathematical Economics, Elsevier, vol. 110(C).
    14. S. Béal & A. Lardon & E. Rémila & P. Solal, 2012. "The average tree solution for multi-choice forest games," Annals of Operations Research, Springer, vol. 196(1), pages 27-51, July.
    15. repec:hal:wpaper:hal-04018735 is not listed on IDEAS
    16. Sylvain Béal & Adriana Navarro-Ramos & Eric Rémila & Philippe Solal, 2025. "Sharing the cost of hazardous transportation networks and the Priority Shapley value for multi-choice games," Annals of Operations Research, Springer, vol. 345(1), pages 59-103, February.
    17. Yu-Hsien Liao, 2018. "The precore: converse consistent enlargements and alternative axiomatic results," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 146-163, April.

    More about this item

    Keywords

    ;
    ;
    ;

    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:cesptp:halshs-00267933. 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.