| Article ID: | iaor2006935 |
| Country: | Germany |
| Volume: | 11 |
| Issue: | 1 |
| Start Page Number: | 93 |
| End Page Number: | 101 |
| Publication Date: | Mar 2003 |
| Journal: | Central European Journal of Operations Research |
| Authors: | Tijs Stef, Raghavan T.E.S., Solymosi Tams |
| Keywords: | sets |
Permutation games are totally balanced transferable utility cooperative games that arise from the classical assignment optimization problem. We prove that for permutation games the Mas–Colell, the classical Aumann–Davis–Maschler, the semireactive, and the reactive bargaining sets all coincide with the core.