14 citations · 35 across the 11 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.GT2022★ 11 cited
New Algorithms for the Fair and Efficient Allocation of Indivisible Chores
Jugal Garg, Aniket Murhekar, John Qin
We study the problem of fairly and efficiently allocating indivisible chores among agents with additive disutility functions. We consider the widely-used envy-based fairness proper…
cs.GT2022★ 14 cited
Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods
Jugal Garg, Aniket Murhekar
We study the problem of fair and efficient allocation of a set of indivisible goods to agents with additive valuations using the popular fairness notions of envy-freeness up to one…
cs.GT2022
(Almost) Envy-Free, Proportional and Efficient Allocations of an Indivisible Mixed Manna
Vasilis Livanos, Ruta Mehta, Aniket Murhekar
We study the problem of finding fair and efficient allocations of a set of indivisible items to a set of agents, where each item may be a good (positively valued) for some agents a…