15 search results - page 2 / 3 » On approximately fair allocations of indivisible goods |
ATAL
2005
Springer
13 years 11 months ago
2005
Springer
Many industrial or research activities are so expensive that it is often benefitable for the involved agents to cofund the construction or the purchase of a common required resou...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
This paper proposes several operational approaches for solving fair allocation problems in the context of multiagent optimization. These problems arise in various contexts such as ...
FOCS
2009
IEEE
14 years 2 days ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
AAAI
2012
11 years 7 months ago
2012
We consider the problem of selecting fair divisions of a heterogeneous divisible good among a set of agents. Recent work (Cohler et al., AAAI 2011) focused on designing algorithms...