Sciweavers

Share
AAMAS
2011
Springer
8 years 9 days ago
Manipulation complexity 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 a...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
ECAI
2010
Springer
8 years 3 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
CONSTRAINTS
1999
120views more  CONSTRAINTS 1999»
8 years 5 months ago
Refined Inequalities for Stable Marriage
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
Brian Aldershof, Olivia M. Carducci, David C. Lore...
DAM
2002
96views more  DAM 2002»
8 years 5 months ago
The structure of stable marriage with indifference
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove tha...
David Manlove
CORR
2010
Springer
190views Education» more  CORR 2010»
8 years 5 months ago
Stable marriage problems with quantitative preferences
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 ha...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
CORR
2010
Springer
125views Education» more  CORR 2010»
8 years 5 months ago
Local search for stable marriage problems with ties and incomplete lists
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
8 years 5 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...
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
8 years 5 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
ACID
2006
239views Algorithms» more  ACID 2006»
8 years 6 months ago
Stable Marriage with Ties and Bounded Length Preference Lists
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
Robert W. Irving, David Manlove, Gregg O'Malley
CP
2006
Springer
8 years 7 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer
books