ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Popular mixed matchings

Kavitha, Telikepalli and Mestre, Julian and Nasre, Meghana (2011) Popular mixed matchings. In: Theoretical Computer Science, 412 (24). pp. 2679-2690.

[img] PDF
Popular.pdf - Published Version
Restricted to Registered users only

Download (308Kb) | Request a copy
Official URL: http://dx.doi.org/10.1016/j.tcs.2010.03.028

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 more 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 on 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 distribution 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. (C) 2010 Elsevier B.V. All rights reserved.

Item Type: Journal Article
Additional Information: Copyright of this article belongs to Elsevier Science.
Keywords: Mixed matchings;Popular matchings;Stable assignments
Department/Centre: Others
Date Deposited: 15 Jun 2011 04:51
Last Modified: 15 Jun 2011 04:51
URI: http://eprints.iisc.ernet.in/id/eprint/38237

Actions (login required)

View Item View Item