6 citations · 9 across the 2 of their papers we have counts for
3 papers
Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness
Bhaskar Ray Chaudhury, Jugal Garg, Peter McGlaughlin +1
We study the computational complexity of finding a competitive equilibrium (CE) with chores when agents have linear preferences. CE is one of the most preferred mechanisms for allo…
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…