34 citations · 142 across the 43 of their papers we have counts for
7 papers · 1 filter
Matching Markets with Chores
Jugal Garg, Thorben Tröbst, Vijay V. Vazirani
The fair division of chores, as well as mixed manna (goods and chores), has received substantial recent attention in the fair division literature; however, ours is the first paper…
On the Theoretical Foundations of Data Exchange Economies
Hannaneh Akrami, Bhaskar Ray Chaudhury, Jugal Garg +1
The immense success of ML systems relies heavily on large-scale, high-quality data. The high demand for data has led to many paradigms that involve selling, exchanging, and sharing…
Improved Maximin Share Approximations for Chores by Bin Packing
Jugal Garg, Xin Huang, Erel Segal-Halevi
We study fair division of indivisible chores among agents with additive cost functions using the popular fairness notion of maximin share (MMS). Since MMS allocations do not al…
Best-of-Both-Worlds Fairness of the Envy-Cycle-Elimination Algorithm
Jugal Garg, Eklavya Sharma
We consider the problem of fairly dividing indivisible goods among agents with additive valuations. It is known that an Epistemic EFX and -MMS allocation can be obtained using…
Constant-Factor EFX Exists for Chores
Jugal Garg, Aniket Murhekar, John Qin
We study the problem of fair allocation of chores to agents with additive preferences. In the discrete setting, envy-freeness up to any chore (EFX) has emerged as a compelling fair…
Weighted EF1 and PO Allocations with Few Types of Agents or Chores
Jugal Garg, Aniket Murhekar, John Qin
We investigate the existence of fair and efficient allocations of indivisible chores to asymmetric agents who have unequal entitlements or weights. We consider the fairness notion…