14 search results - page 1 / 3 » An approximation algorithm for max-min fair allocation of in... |
STOC
2009
ACM
14 years 11 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
STOC
2007
ACM
14 years 11 months ago
2007
ACM
SIGECOM
2004
ACM
14 years 4 months ago
2004
ACM
ALDT
2009
Springer
14 years 2 months ago
2009
Springer
We study the problem of allocating a set of indivisible goods to a set of agents having additive preferences. We introduce two new important complexity results concerning efficienc...
ECAI
2010
Springer
13 years 12 months ago
2010
Springer
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...