Sciweavers

WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
13 years 10 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...