Improving man-optimal stable matchings by minimum change of preference lists

Inoshita, T., Irving, R.W., Iwama, K., Miyazaki, S. and Nagase, T. (2011) Improving man-optimal stable matchings by minimum change of preference lists. In: 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Kyoto, Japan, 31 May - 3 Jun 2011, pp. 309-313.

Full text not currently available from Enlighten.

Abstract

In the stable marriage problem, any instance admits so-called the 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(nˆ3) and O(nˆ2), respectively, where n is the number of men (women) in an input.

Item Type:Conference Proceedings
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Irving, Dr Rob
Authors: Inoshita, T., Irving, R.W., Iwama, K., Miyazaki, S., and Nagase, T.
College/School:College of Science and Engineering > School of Computing Science
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record