activity
20202026
most citedApproximation Algorithms for Generalized Multidimensional Knapsack

4 citations · 6 across the 9 of their papers we have counts for

collaborators
Showing cs.GTShow all

8 papers · 1 filter

cs.GT2026

Tight Subsidy Bounds for Weighted Proportional Allocation of Mixed Manna

Jugal Garg, Eklavya Sharma, Xiaowei Wu

We study the problem of fairly allocating m indivisible items among n agents with possibly unequal entitlements in the mixed manna setting, where each item may be perceived as a go…

cs.GT2026

Equilibrium Pricing in Oligopolistic Data Markets

Bhaskar Ray Chaudhury, Jugal Garg, Eklavya Sharma +1

We study equilibrium pricing in oligopolistic data markets with budget-constrained buyers (e.g., machine learning companies purchasing data to improve model accuracy) and strategic…

cs.GT2026

Revenue-Optimal Pricing for Budget-Constrained Buyers in Data Markets

Bhaskar Ray Chaudhury, Jugal Garg, Eklavya Sharma +1

We study revenue-optimal pricing in data markets with rational, budget-constrained buyers. Such a market offers multiple datasets for sale, and buyers aim to improve the accuracy o…

cs.GT2025

Proportional and Pareto-Optimal Allocation of Chores with Subsidy

Jugal Garg, Eklavya Sharma, Xiaowei Wu

We consider the problem of allocating indivisible chores among agents with possibly different weights, aiming for a solution that is both fair and efficient. Specifically,…

cs.GT2025

Exploring Relations among Fairness Notions in Discrete Fair Division

Jugal Garg, Eklavya Sharma

Fair allocation of indivisible items among agents is a fundamental and extensively studied problem. However, fairness does not have a single universally accepted definition, leadin…

cs.GT2024

EF1 for Mixed Manna with Unequal Entitlements

Jugal Garg, Eklavya Sharma

We study fair division of indivisible mixed manna when agents have unequal entitlements, with weighted envy-freeness up to one item (WEF1) as our primary notion of fairness. We ide…