25 search results - page 5 / 5 » Stable marriage problems with quantitative preferences |
ICDCS
2009
IEEE
15 years 7 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
85
Voted
ESA
2007
Springer
15 years 4 months ago
2007
Springer
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
80
Voted
IPL
2007
14 years 10 months ago
2007
Recently, a number of interesting algorithmic problems have arisen from the emergence, in a number of countries, of kidney exchange schemes, whereby live donors are matched with r...
WWW
2009
ACM
15 years 11 months ago
2009
ACM
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
102
click to vote
CLIMA
2010
14 years 10 months ago
2010
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...