Constrained core solutions for totally positive games with ordered players

J.R. van den Brink, G. van der Laan, V. Vasil'ev

    Research output: Contribution to JournalArticleAcademicpeer-review

    Abstract

    In many applications of cooperative game theory to economic allocation problems, such as river-, polluted river- and sequencing games, the game is totally positive (i.e., all dividends are nonnegative), and there is some ordering on the set of the players. A totally positive game has a nonempty core. In this paper we introduce constrained core solutions for totally positive games with ordered players which assign to every such a game a subset of the core. These solutions are based on the distribution of dividends taking into account the hierarchical ordering of the players. The Harsanyi constrained core of a totally positive game with ordered players is a subset of the core of the game and contains the Shapley value. For special orderings it coincides with the core or the Shapley value. The selectope constrained core is defined for acyclic orderings and yields a subset of the Harsanyi constrained core. We provide a characterization for both solutions. © 2013 Springer-Verlag Berlin Heidelberg.
    Original languageEnglish
    Pages (from-to)351-368
    JournalInternational Journal of Game Theory
    Volume43
    Issue number2
    DOIs
    Publication statusPublished - 2014

    Fingerprint

    Dive into the research topics of 'Constrained core solutions for totally positive games with ordered players'. Together they form a unique fingerprint.

    Cite this