Pareto Optimality in House Allocation Problems

We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maximum cardinality Pareto optimal matching, where n is the number of agents and m is the total length of the preference lists. By contrast, we show that the problem of finding a minimum cardinality Pareto optimal matching is NP-hard, though approximable within a factor of 2. We then show that there exist Pareto optimal matchings of all sizes between a minimum and maximum cardinality Pareto optimal matching. Finally, we introduce the concept of a signature, which allows us to give a characterization, checkable in linear time, of instances that admit a unique Pareto optimal matching.

• Type: Conference
• Year: 2004
• Where: ISAAC
• Authors: David J. Abraham, Katarína Cechlárová, David Manlove, Kurt Mehlhorn
• Keywords: Cardinality Pareto, ISAAC 2004, Maximum Cardinality Pareto, Pareto Optimal Matching