All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A new value for cooperative games on intersection-closed systems

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10502309" target="_blank" >RIV/00216208:11320/25:10502309 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=-u5jLCh-Di" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=-u5jLCh-Di</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.mathsocsci.2025.102450" target="_blank" >10.1016/j.mathsocsci.2025.102450</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A new value for cooperative games on intersection-closed systems

  • Original language description

    In the model of cooperative games with restricted cooperation, certain coalitions are infeasible, meaning they cannot form, which directly influences payoff allocation. We consider a scenario where coalitions are no longer categorized as feasible or infeasible, but rather as known or unknown. In this setting, coalitions with unknown values are still feasible, but their values remain unknown in the allocation process. Classical allocation methods for games with restricted cooperation, such as the R-value, become unsuitable for such scenarios. We introduce a new allocation rule called the uniform-dividend value (UD-value), designed specifically for cooperative games where some coalition values remain unknown (so-called incomplete cooperative games). The UD-value allocates payoffs by evenly distributing the total surplus within each group of indistinguishable coalitions. We demonstrate that for intersection-closed set systems, the UD-value is uniquely determined and can also be viewed as the expected Shapley value computed over all totally positive (i.e., nonnegative-surplus) extensions of the incomplete cooperative game. We compare the UD-value to two existing allocation rules for intersection-closed games: the R-value, defined as the Shapley value of a game that sets surplus of absent coalition values to zero, and the IC-value, tailored specifically for intersection-closed systems. Specifically, we provide axiomatic characterizations of the UD-value motivated by characterizations of the IC-value and discuss further properties such as fairness and balanced contributions.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    50201 - Economic Theory

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2025

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Mathematical Social Sciences

  • ISSN

    0165-4896

  • e-ISSN

    1879-3118

  • Volume of the periodical

    138

  • Issue of the periodical within the volume

    Decemeber

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    18

  • Pages from-to

    62-79

  • UT code for WoS article

    001567382400005

  • EID of the result in the Scopus database

    2-s2.0-105012967629