Kavitha, Telikepalli and Mestre, Julian and Nasre, Meghana (2009) Popular Mixed Matchings. [Book Chapter]
Full text not available from this repository. (Request a copy)Abstract
We study the problem of matching applicants to jobs under one-sided preferences: that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be rnore popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M,T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based oil the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distributions over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P,Q) >= phi(Q,P) for all mixed matchings Q. We show that popular mixed matchings always exist. and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem.
| Item Type: | Book Chapter |
|---|---|
| Series.: | Lecture Notes in Computer Science |
| Publisher: | Springer |
| Additional Information: | Copyright for this article belongs to Springer. |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 10 Dec 2009 10:44 |
| Last Modified: | 23 Oct 2018 14:46 |
| URI: | http://eprints.iisc.ac.in/id/eprint/24931 |
Actions (login required)
 |
View Item |
