Next Article in Journal / Special Issue
Maximum Locally Stable Matchings
Previous Article in Journal
Filtering Degenerate Patterns with Application to Protein Sequence Analysis
Previous Article in Special Issue
Stable Multicommodity Flows
Algorithms 2013, 6(2), 371-382; doi:10.3390/a6020371
Article

Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists

1
, 2
, 1
, 3,*  and 4
Received: 27 December 2012; in revised form: 17 May 2013 / Accepted: 20 May 2013 / Published: 28 May 2013
(This article belongs to the Special Issue Special Issue on Matching under Preferences)
Download PDF [153 KB, updated 29 May 2013; original version uploaded 28 May 2013]
Abstract: In the stable marriage problem, any instance admits the so-called man-optimal stable matching, in which every man is assigned the best possible partner. However, there are instances for which all men receive low-ranked partners even in the man-optimal stable matching. In this paper we consider the problem of improving the man-optimal stable matching by changing only one man’s preference list. We show that the optimization variant and the decision variant of this problem can be solved in time O(n3) and O(n2), respectively, where n is the number of men (women) in an input. We further extend the problem so that we are allowed to change k men’s preference lists. We show that the problem is W[1]-hard with respect to the parameter k and give O(n2k+1)-time and O(nk+1)-time exact algorithms for the optimization and decision variants, respectively. Finally, we show that the problems become easy when k = n; we give O(n2.5 log n)-time and O(n2)-time algorithms for the optimization and decision variants, respectively.
Keywords: combinatorial optimization; polynomial-time algorithms; stable marriage problem; man-optimal stable matching combinatorial optimization; polynomial-time algorithms; stable marriage problem; man-optimal stable matching
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Export to BibTeX |
EndNote


MDPI and ACS Style

Inoshita, T.; Irving, R.W.; Iwama, K.; Miyazaki, S.; Nagase, T. Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists. Algorithms 2013, 6, 371-382.

AMA Style

Inoshita T, Irving RW, Iwama K, Miyazaki S, Nagase T. Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists. Algorithms. 2013; 6(2):371-382.

Chicago/Turabian Style

Inoshita, Takao; Irving, Robert W.; Iwama, Kazuo; Miyazaki, Shuichi; Nagase, Takashi. 2013. "Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists." Algorithms 6, no. 2: 371-382.


Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert