Scaling algorithms for the shortest paths problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic matching markets and voting paths
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Pareto optimality in house allocation problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Bounded Unpopularity Matchings
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Popular Matchings: Structure and Algorithms
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Popular Matchings with Variable Job Capacities
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Popular matchings in the weighted capacitated house allocation problem
Journal of Discrete Algorithms
Popular matchings with variable item copies
Theoretical Computer Science
SIAM Journal on Discrete Mathematics
Theoretical Computer Science
An experimental comparison of single-sided preference matching algorithms
Journal of Experimental Algorithmics (JEA)
Popular matchings in the stable marriage problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Social welfare in one-sided matching markets without money
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Popular matchings: structure and algorithms
Journal of Combinatorial Optimization
Near-popular matchings in the roommates problem
ESA'11 Proceedings of the 19th European conference on Algorithms
Popularity vs maximum cardinality in the stable marriage setting
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Popular matchings in the marriage and roommates problems
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Popular matchings in the stable marriage problem
Information and Computation
Discrete Applied Mathematics
Journal of Combinatorial Optimization
Hi-index | 0.00 |
We consider the problem of choosing the best matching of people to positions based on preferences expressed by the people, for which many different optimality criteria have been proposed. A matching is popular if no other matching beats it in a majority vote of the people. The popularity criterion has a manipulation-resistance property, but unfortunately, some sets of preferences admit no popular matching. In this paper, we introduce the least-unpopularity-factor and least-unpopularity-margin criteria, two generalizations of popularity that preserve the manipulation-resistance property but give an optimal matching for every set of preferences. Under each of these generalizations, we show that the "badness" of a given matching can be calculated efficiently but it is NP-hard to find an optimal matching.