Sciweavers

134 search results - page 1 / 27
» Adaptive stable marriage algorithms
Sort
View
ACMSE
2010
ACM
13 years 2 months ago
Adaptive stable marriage algorithms
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...
John Dabney, Brian C. Dean
ALDT
2009
Springer
162views Algorithms» more  ALDT 2009»
13 years 11 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...
CORR
2010
Springer
190views Education» more  CORR 2010»
13 years 4 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 ...
ATAL
2009
Springer
13 years 11 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 ...
AAMAS
2011
Springer
12 years 11 months 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 ...