Characterizations of the random order values by Harsanyi payoff vectors (Q857816): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00186-006-0063-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983935643 / rank
 
Normal rank

Revision as of 19:13, 19 March 2024

scientific article
Language Label Description Also known as
English
Characterizations of the random order values by Harsanyi payoff vectors
scientific article

    Statements

    Characterizations of the random order values by Harsanyi payoff vectors (English)
    0 references
    5 January 2007
    0 references
    The paper under review deals with one of the solution concepts of cooperative games with transferable utility. The Harsanyi solution of such games is investigated, namely the Harsanyi payoff vector obtained by a distribution of Harsanyi dividents of all coalitions among the players. The attention is focused on the concept of random order values being the convex combinations of the marginal contribution vectors from the Harsanyi set. Two characterizations of the set of all sharing systems of the dividents whose associated Harsanyi payoffs are random order values. The first characterization deals with extreme points of the set of sharing systems, meanwhile the second one shows that a Harsanyi payoff vector is a random order value iff the sharing system is strongly monotonic.
    0 references
    TU-games
    0 references
    Harsanyi set
    0 references
    Weber set
    0 references
    Selectope
    0 references
    Monotonic sharing system
    0 references
    Dividents
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers