Sciweavers

ALGORITHMICA
2010
122views more  ALGORITHMICA 2010»
14 years 17 days ago
Faster Algorithms for Stable Allocation Problems
We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Ba
Brian C. Dean, Siddharth Munshi
ALGORITHMICA
2010
192views more  ALGORITHMICA 2010»
14 years 17 days 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
ALGORITHMICA
2010
111views more  ALGORITHMICA 2010»
14 years 17 days 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
HIPC
2003
Springer
14 years 5 months ago
A Parallel Iterative Improvement Stable Matching Algorithm
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
Enyue Lu, S. Q. Zheng
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
14 years 9 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang