Another proof that assignment games have singleton cores only if multiple optimal matchings exist
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Theo S. H. Driessen, 1998. "A note on the inclusion of the kernel in the core of the bilateral assignment game," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(2), pages 301-303.
- Leonard, Herman B, 1983. "Elicitation of Honest Preferences for the Assignment of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 91(3), pages 461-479, June.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Christopher P. Chambers & Federico Echenique, 2015. "The Core Matchings of Markets with Transfers," American Economic Journal: Microeconomics, American Economic Association, vol. 7(1), pages 144-164, February.
- Bettina Klaus & Frédéric Payot, 2013. "Paths to Stability in the Assignment Problem," Cahiers de Recherches Economiques du Département d'Econométrie et d'Economie politique (DEEP) 13.14, Université de Lausanne, Faculté des HEC, DEEP.
More about this item
KeywordsAssignment game; Complementary slackness; Core; Matching;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:29:y:2006:i:1:p:213-217. 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: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .