Sciweavers

662 search results - page 5 / 133
» Classified Stable Matching
Sort
View
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
14 years 9 months ago
Almost Stable Matchings by Truncating the Gale-Shapley Algorithm
We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose
Patrik Floréen, Petteri Kaski, Valentin Pol...
CP
2005
Springer
15 years 3 months ago
Specialised Constraints for Stable Matching Problems
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
Chris Unsworth, Patrick Prosser
ALGORITHMICA
2010
111views more  ALGORITHMICA 2010»
14 years 9 months ago
Three-Sided Stable Matchings with Cyclic Preferences
Knuth [14] asked whether the stable matching problem can be generalised to three dimensions i. e., for families containing a man, a woman and a dog. Subsequently, several authors ...
Péter Biró, Eric McDermid
ALGORITHMICA
2010
192views more  ALGORITHMICA 2010»
14 years 9 months ago
Circular Stable Matching and 3-way Kidney Transplant
We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...
Chien-Chung Huang
ICDCS
2009
IEEE
15 years 6 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir