- Stable roommates problem
In
mathematics , especially in the fields ofgame theory andcombinatorics , the stable roommate problem (SRP) is the problem of finding a stable matching — amatching in which there is no pair of elements, each from a different matched set, where each member of the pair prefers the other to their match. This is different from thestable marriage problem in that the stable roommates problem does not require that a set is broken up into male and female subsets. Any person can prefer anyone in the same set.It is commonly stated as:: In a given instance of the Stable Roommates problem (SRP), each of "2n" participants ranks the others in strict order of preference. A matching is a set of "n" disjoint (unordered) pairs of participants. A matching "M" in an instance of SRP is stable if there are no two participants "x" and "y", each of whom prefers the other to his partner in "M". Such a pair is said to block "M", or to be a blocking pair with respect to "M".
olution
Algorithm
An efficient algorithm was given in harv|Irving|1985.
Applications
References
*citation | title=An efficient algorithm for the "stable roommates" problem | journal = Journal of Algorithms | issn=01966774 | volume=6 | number=4 | year=1985 | pages=577-595 | first1=Robert W. | last1=Irving | doi=10.1016/0196-6774(85)90033-1
*citation | title=The Stable Roommates Problem with Ties | first1=Robert W. | last1=Irving | first2=David F. | last2=Manlove | journal=Journal of Algorithms | issn=01966774 | volume=43 | number=1 | pages=85-105 | year=2002 | url=http://eprints.gla.ac.uk/11/01/SRT.pdf | doi=10.1006/jagm.2002.1219
Wikimedia Foundation. 2010.