Sciweavers

662 search results - page 8 / 133
» Classified Stable Matching
Sort
View
ESA
2003
Springer
140views Algorithms» more  ESA 2003»
15 years 2 months ago
Improved Approximation of the Stable Marriage Problem
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
Magnús M. Halldórsson, Kazuo Iwama, ...
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
14 years 9 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
Dániel Marx, Ildikó Schlotter
ATAL
2009
Springer
15 years 4 months ago
Manipulation and gender neutrality in stable marriage procedures
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 ...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
PRL
2006
129views more  PRL 2006»
14 years 9 months ago
Learning spatial relations in object recognition
This paper studies two types of spatial relationships that can be learned from training examples for object recognition. The first one employs deformable relationships between obj...
Thang V. Pham, Arnold W. M. Smeulders
ALDT
2009
Springer
162views Algorithms» more  ALDT 2009»
15 years 4 months ago
Compact Preference Representation in Stable Marriage Problems
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
Enrico Pilotto, Francesca Rossi, Kristen Brent Ven...