The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
ACM Transactions on Algorithms (TALG)
Popular matchings in the capacitated house allocation problem
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
SIAM Journal on Computing
Bounded Unpopularity Matchings
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
The stable marriage problem with master preference lists
Discrete Applied Mathematics
Discrete Applied Mathematics
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Popular Matchings with Variable Job Capacities
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Pareto optimality in house allocation problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Journal of Combinatorial Optimization
| Hi-index | 5.23 |
We consider the problem of matching people to items, where each person ranks a subset of items in an order of preference, possibly involving ties. There are several notions of optimality about how to best match a person to an item; in particular, popularity is a natural and appealing notion of optimality. A matching M^* is popular if there is no matching M such that the number of people who prefer M to M^* exceeds the number who prefer M^* to M. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not admit popular matchings. This motivates the following extension of the popular matchings problem: *Given a graph G=(A@?B,E) where A is the set of people and B is the set of items, and a list denoting upper bounds on the number of copies of each item, does there exist such that for each i, having x"i copies of the i-th item, where 1@?x"i@?c"i, enables the resulting graph to admit a popular matching? In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c"i is 1 or 2. We show a polynomial time algorithm for a variant of the above problem where the total increase in copies is bounded by an integer k.