Many-to-Many Matching with Max-Min Preferences

John Hatfield (), Fuhito Kojima () and Yusuke Narita ()
Additional contact information
John Hatfield: University of Texas at Austin
Fuhito Kojima: Stanford University

No 12-020, Discussion Papers from Stanford Institute for Economic Policy Research

Abstract: We consider the many-to-many two-sided matching problem under a stringent domain restriction on preferences called the max-min criterion. We show that, even under this restriction, there is no stable mechanism that is weakly Pareto efficient, strategy-proof, or monotonic (i.e. respects improvements) for agents on one side of the market. These results imply in particular that three of the main results of [4] are incorrect.

Date: 2012-12
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www-siepr.stanford.edu/repec/sip/12-020.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 500 Can't connect to www-siepr.stanford.edu:80 (nodename nor servname provided, or not known)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sip:dpaper:12-020

Access Statistics for this paper

More papers in Discussion Papers from Stanford Institute for Economic Policy Research Contact information at EDIRC.
Bibliographic data for series maintained by Anne Shor ( this e-mail address is bad, please contact ).