34 citations · 120 across the 32 of their papers we have counts for
4 papers · 1 filter
Competitive Allocation of a Mixed Manna
Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin +1
We study the fair division problem of allocating a mixed manna under additively separable piecewise linear concave (SPLC) utilities. A mixed manna contains goods that everyone like…
Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores
Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin +1
We study the chore division problem where a set of agents needs to divide a set of chores (bads) among themselves fairly and efficiently. We assume that agents have linear disutili…
Indivisible Mixed Manna: On the Computability of MMS + PO Allocations
Rucha Kulkarni, Ruta Mehta, Setareh Taki
In this paper we initiate the study of finding fair and efficient allocations of an indivisible mixed manna: Divide m indivisible items among n agents under the fairness notion of…
Fair and Efficient Allocations under Subadditive Valuations
Bhaskar Ray Chaudhury, Jugal Garg, Ruta Mehta
We study the problem of allocating a set of indivisible goods among agents with subadditive valuations in a fair and efficient manner. Envy-Freeness up to any good (EFX) is the mos…