Assignment games with stable core
- Cite this article as:
- Solymosi, T. & Raghavan, T. Game Theory (2001) 30: 177. doi:10.1007/s001820100072
- 226 Views
We prove that the core of an assignment game (a two-sided matching game with transferable utility as introduced by Shapley and Shubik, 1972) is stable (i.e., it is the unique von Neumann-Morgenstern solution) if and only if there is a matching between the two types of players such that the corresponding entries in the underlying matrix are all row and column maximums. We identify other easily verifiable matrix properties and show their equivalence to various known sufficient conditions for core-stability. By these matrix characterizations we found that on the class of assignment games, largeness of the core, extendability and exactness of the game are all equivalent conditions, and strictly imply the stability of the core. In turn, convexity and subconvexity are equivalent, and strictly imply all aformentioned conditions.