28 citations · 156 across the 43 of their papers we have counts for
57 papers
Parameterized Guarantees for Almost Envy-Free Allocations
Siddharth Barman, Debajyoti Kar, Shraddha Pathak
We study fair allocation of indivisible goods among agents with additive valuations. We obtain novel approximation guarantees for three of the strongest fairness notions in discret…
Learning Good Interventions in Causal Graphs via Covering
Ayush Sawarni, Rahul Madhavan, Gaurav Sinha +1
We study the causal bandit problem that entails identifying a near-optimal intervention from a specified set of (possibly non-atomic) interventions over a given causal graph. H…
Guaranteeing Envy-Freeness under Generalized Assignment Constraints
Siddharth Barman, Arindam Khan, Sudarshan Shyam +1
We study fair division of goods under the broad class of generalized assignment constraints. In this constraint framework, the sizes and values of the goods are agent-specific, and…
Fair Chore Division under Binary Supermodular Costs
Siddharth Barman, Vishnu V. Narayan, Paritosh Verma
We study the problem of dividing indivisible chores among agents whose costs (for the chores) are supermodular set functions with binary marginals. Such functions capture complemen…
Approximation Algorithms for Envy-Free Cake Division with Connected Pieces
Siddharth Barman, Pooja Kulkarni
Cake cutting is a classic model for studying fair division of a heterogeneous, divisible resource among agents with individual preferences. Addressing cake division under a typical…
Finding Fair Allocations under Budget Constraints
Siddharth Barman, Arindam Khan, Sudarshan Shyam +1
We study the fair allocation of indivisible goods among agents with identical, additive valuations but individual budget constraints. Here, the indivisible goods--each with a speci…