Many-to-Many Matching with Max-Min Preferences

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 Baiou and Balinski (2000) are incorrect

MoreLess

Year of publication:	2012
Authors:	Hatfield, John William
Other Persons:	Kojima, Fuhito (contributor) ; Narita, Yusuke (contributor)
Publisher:	[2012]: [S.l.] : SSRN
Subject:	Matching \| Präferenztheorie \| Theory of preferences \| Suchtheorie \| Search theory

freely available

Full text |

More access options

doi.org

Check Google Scholar

In German libraries (KVK)

I need help

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10013112265