Assignment games with stable core
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.
Volume (Year): 30 (2001)
Issue (Month): 2 ()
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00182/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:30:y:2001:i:2:p:177-185. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.