The stable fixtures problem—A many-to-many extension of stable roommates |
| |
| Authors: | Robert W Irving |
| |
| Institution: | Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, Scotland |
| |
| Abstract: | We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time algorithm that determines whether a stable matching exists, and if so, returns one such matching. |
| |
| Keywords: | Stable matching problem Many-to-many non-bipartite matching Linear-time algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
