28 search results - page 1 / 6 » Stability in Matching Problems with Weighted Preferences |
ICAART
2011
INSTICC
12 years 8 months ago
2011
INSTICC
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...
ALGORITHMICA
2010
13 years 4 months ago
2010
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 ...
CP
2006
Springer
13 years 6 months ago
2006
Springer
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...
JDA
2008
13 years 4 months ago
2008
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this...