Skip to content Skip to navigation

Many-to-Many Matching with Max-Min Preferences

Dec 2012
Working Paper
12-020
By  John Hatfield, Fuhito Kojima, Yusuke Narita
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.