502 search results - page 1 / 101 » Popular Mixed Matchings |
ICALP
2009
Springer
13 years 11 months ago
2009
Springer
We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly inv...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
CIAC
2010
Springer
14 years 2 months ago
2010
Springer
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
ESA
2006
Springer
13 years 8 months ago
2006
Springer