Abstract
For games with a non-empty core the Alexia value is introduced, a value which averages the lexicographic maxima of the core. It is seen that the Alexia value coincides with the Shapley value for convex games, and with the nucleolus for strongly compromise admissible games and big boss games. For simple flow games, clan games and compromise stable games an explicit expression and interpretation of the Alexia value is derived. Furthermore it is shown that the reverse Alexia value, defined by averaging the lexicographic minima of the core, coincides with the Alexia value for convex games and compromise stable games.
Original language | English |
---|---|
Pages (from-to) | 210-220 |
Journal | European Journal of Operational Research |
Volume | 213 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2011 |
Keywords
- game theory
- Alexia value
- convexity
- comprise stability
- big boss and clan games