9 search results - page 2 / 2 » Procedural fairness in stable marriage problems |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more genera...
WADS
2007
Springer
15 years 3 months ago
2007
Springer
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
CONSTRAINTS
1999
14 years 9 months ago
1999
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
ATAL
2001
Springer
15 years 2 months ago
2001
Springer
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...