Biro, P. and McDermid, E. (2010) Three-sided stable matchings with cyclic preferences. Algorithmica, 58(1), pp. 5-18. (doi: 10.1007/s00453-009-9315-2)
Full text not currently available from Enlighten.
Publisher's URL: http://dx.doi.org/10.1007/s00453-009-9315-2
Abstract
Knuth (Mariages Stables, Les Presses de L'Universit, de Montr,al, 1976) asked whether the stable matching problem can be generalised to three dimensions, e.g., for families containing a man, a woman and a dog. Subsequently, several authors considered the three-sided stable matching problem with cyclic preferences, where men care only about women, women only about dogs, and dogs only about men. In this paper we prove that if the preference lists may be incomplete, then the problem of deciding whether a stable matching exists, given an instance of the three-sided stable matching problem with cyclic preferences, is NP-complete. Considering an alternative stability criterion, strong stability, we show that the problem is NP-complete even for complete lists. These problems can be regarded as special types of stable exchange problems, therefore these results have relevance in some real applications, such as kidney exchange programs.
| Item Type: | Articles |
|---|---|
| Status: | Published |
| Refereed: | Yes |
| Glasgow Author(s) Enlighten ID: | Biro, Dr Peter and McDermid, Mr Eric |
| Authors: | Biro, P., and McDermid, E. |
| College/School: | College of Science and Engineering > School of Computing Science |
| Journal Name: | Algorithmica |
| ISSN: | 0178-4617 |
| ISSN (Online): | 1432-0541 |
University Staff: Request a correction | Enlighten Editors: Update this record
Funder and Project Information
Funder and Project Information