Abstract
This paper analyzes the 1-nucleolus and, in particular, its relation to the nucleolus. It is seen that, contrary to the nucleolus, the 1-nucleolus can be computed in polynomial time due to a characterization using a combination of standard bankruptcy rules for associated bankruptcy problems. Sufficient conditions on a compromise stable game are derived such that the 1-nucleolus and the nucleolus coincide.
Original language | English |
---|---|
Pages (from-to) | 309-329 |
Journal | Mathematical Methods of Operations Research |
Volume | 86 |
Issue number | 2 |
DOIs | |
Publication status | Published - Oct 2017 |
Keywords
- 1-nucleolus
- compromise stable games
- Aumann-Maschler rule
- nucleolus