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...
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...
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 ...
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...
Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khan...
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...
Steven J. Brams, Michal Feldman, John K. Lai, Jami...