9 search results - page 1 / 2 » Almost Stable Matchings by Truncating the Gale-Shapley Algor... |
ALGORITHMICA
2010
13 years 11 months ago
2010
We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose
ESA
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...
AAMAS
2011
Springer
13 years 5 months ago
2011
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a...
ATAL
2009
Springer
14 years 5 months ago
2009
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has ...
ESA
2006
Springer
14 years 2 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...