Allocation rules for games with optimistic aspirations (Q457859)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Allocation rules for games with optimistic aspirations |
scientific article; zbMATH DE number 6349557
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Allocation rules for games with optimistic aspirations |
scientific article; zbMATH DE number 6349557 |
Statements
Allocation rules for games with optimistic aspirations (English)
0 references
30 September 2014
0 references
Summary: A game with optimistic aspirations specifies two values for each coalition of players: the first value is the worth that the players in the coalition can guarantee for themselves in the event that they coordinate their actions, and the second value is the amount that the players in the coalition aspire to get under reasonable but very optimistic assumptions about the demands of the players who are not included in the coalition. In this paper, in addition to presenting this model and justifying its relevance, we introduce allocation rules and extend the properties of efficiency, additivity, symmetry, and null player property to this setting. We demonstrate that these four properties are insufficient to find a unique allocation rule and define three properties involving null players and nullifying players that allow the identification of unique allocation rules. The allocation rules we identify are the Midpoint Shapley Value and the Equal Division Rule.
0 references
0.8771747
0 references
0 references
0.8456504
0 references
0.84518313
0 references
0.8394968
0 references
0 references
0 references
0.83448064
0 references
0 references