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

Sharing values for multi-choice games: an axiomatic approach

Author

Listed:
  • David Lowing

    (Kyushu University, CRESE - Centre de REcherches sur les Stratégies Economiques (UR 3190) - UFC - Université de Franche-Comté - UBFC - Université Bourgogne Franche-Comté [COMUE], LGI - Laboratoire Génie Industriel - CentraleSupélec - Université Paris-Saclay)

  • Makoto Yokoo

    (Kyushu University)

Abstract

A Sharing value for transferable utility games distributes the Harsanyi dividend of each coalition among the players in the coalition's support. Such distribution is done according to a certain sharing system that determines the Sharing value. In this paper, we extend Sharing values to multi-choice games. Multi-choice games are a generalization of transferable utility games in which players have several activity levels. Unlike in transferable utility games, there is no straightforward way to interpret the support of a coalition in a multi-choice game. This makes it more tedious to distribute the Harsanyi dividend of a multi-choice coalition. We consider three possible interpretations of the support of a multi-choice coalition. Based on these interpretations, we derive three families of Sharing values for multi-choice games. To conduct this study, we discuss novel and classical axioms for multi-choice games. This allows us to provide an axiomatic foundation for each of these families of values.

Suggested Citation

  • David Lowing & Makoto Yokoo, 2025. "Sharing values for multi-choice games: an axiomatic approach," Post-Print hal-04018735, HAL.
    • Handle: RePEc:hal:journl:hal-04018735
    DOI: 10.1007/s00182-025-00952-4
    Note: View the original document on HAL open archive server: https://hal.science/hal-04018735v1
    as

    Download full text from publisher

    File URL: https://hal.science/hal-04018735v1/document
    Download Restriction: no
    File URL: https://libkey.io/10.1007/s00182-025-00952-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
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;

    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:hal:journl:hal-04018735. 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.