Siddharth Barman

research

∙ 05/08/2023

Learning Good Interventions in Causal Graphs via Covering

We study the causal bandit problem that entails identifying a near-optim...

0 Ayush Sawarni, et al. ∙

research

∙ 05/02/2023

Guaranteeing Envy-Freeness under Generalized Assignment Constraints

We study fair division of goods under the broad class of generalized ass...

0 Siddharth Barman, et al. ∙

research

∙ 02/22/2023

Fair Chore Division under Binary Supermodular Costs

We study the problem of dividing indivisible chores among agents whose c...

0 Siddharth Barman, et al. ∙

research

∙ 08/18/2022

Approximation Algorithms for Envy-Free Cake Division with Connected Pieces

Cake cutting is a classic model for studying fair division of a heteroge...

0 Siddharth Barman, et al. ∙

research

∙ 08/17/2022

Finding Fair Allocations under Budget Constraints

We study the fair allocation of indivisible goods among agents with iden...

0 Siddharth Barman, et al. ∙

research

∙ 07/05/2022

Nash Welfare Guarantees for Fair and Efficient Coverage

We study coverage problems in which, for a set of agents and a given thr...

0 Siddharth Barman, et al. ∙

research

∙ 05/27/2022

Fairness and Welfare Quantification for Regret in Multi-Armed Bandits

We extend the notion of regret with a welfarist perspective. Focussing o...

0 Siddharth Barman, et al. ∙

research

∙ 01/19/2022

Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations

We study the problem of allocating indivisible goods among agents in a f...

0 Siddharth Barman, et al. ∙

research

∙ 11/01/2021

Intervention Efficient Algorithm for Two-Stage Causal MDPs

We study Markov Decision Processes (MDP) wherein states correspond to ca...

0 Rahul Madhavan, et al. ∙

research

∙ 10/02/2021

Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations

We study the problem of allocating indivisible goods among n agents with...

0 Siddharth Barman, et al. ∙

research

∙ 09/13/2021

Truthful and Fair Mechanisms for Matroid-Rank Valuations

We study the problem of allocating indivisible goods among strategic age...

0 Siddharth Barman, et al. ∙

research

∙ 09/02/2021

Universal and Tight Online Algorithms for Generalized-Mean Welfare

We study fair and efficient allocation of divisible goods, in an online ...

0 Siddharth Barman, et al. ∙

research

∙ 06/04/2021

Approximating Nash Social Welfare under Binary XOS and Binary Subadditive Valuations

We study the problem of allocating indivisible goods among agents in a f...

0 Siddharth Barman, et al. ∙

research

∙ 05/04/2021

Optimal Algorithms for Range Searching over Multi-Armed Bandits

This paper studies a multi-armed bandit (MAB) version of the range-searc...

0 Siddharth Barman, et al. ∙

research

∙ 12/23/2020

Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations

We study fair and economically efficient allocation of indivisible goods...

0 Siddharth Barman, et al. ∙

research

∙ 10/02/2020

Tight Approximation Guarantees for Concave Coverage Problems

In the maximum coverage problem, we are given subsets T_1, …, T_m of a u...

0 Siddharth Barman, et al. ∙

research

∙ 07/13/2020

Settling the Price of Fairness for Indivisible Goods

In the allocation of resources to a set of agents, how do fairness guara...

0 Siddharth Barman, et al. ∙

research

∙ 05/31/2020

Fair Cake Division Under Monotone Likelihood Ratios

This work develops algorithmic results for the classic cake-cutting prob...

0 Siddharth Barman, et al. ∙

research

∙ 05/15/2020

Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations

We develop polynomial-time algorithms for the fair and efficient allocat...

0 Siddharth Barman, et al. ∙

research

∙ 05/01/2020

Uniform Welfare Guarantees Under Identical Subadditive Valuations

We study the problem of allocating indivisible goods among agents that h...

0 Siddharth Barman, et al. ∙

research

∙ 09/03/2019

Quantifying Infra-Marginality and Its Trade-off with Group Fairness

In critical decision-making scenarios, optimizing accuracy can lead to a...

0 Arpita Biswas, et al. ∙

research

∙ 07/25/2019

Fair and Efficient Cake Division with Connected Pieces

The classic cake-cutting problem provides a model for addressing fair an...

0 Eshwar Ram Arunachaleswaran, et al. ∙

research

∙ 05/13/2019

The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies

We revisit the connection between bargaining and equilibrium in exchange...

0 Siddharth Barman, et al. ∙

research

∙ 05/02/2019

Tight Approximation Bounds for Maximum Multi-Coverage

In the classic maximum coverage problem, we are given subsets T_1, ..., ...

0 Siddharth Barman, et al. ∙

research

∙ 01/27/2019

Fair Division of Indivisible Goods Among Strategic Agents

We study fair division of indivisible goods in a single-parameter enviro...

0 Siddharth Barman, et al. ∙

research

∙ 11/27/2018

Fair Division with a Secretive Agent

We study classic fair-division problems in a partial information setting...

0 Eshwar Ram Arunachaleswaran, et al. ∙

research

∙ 11/21/2018

On the Proximity of Markets with Integral Equilibria

We study Fisher markets that admit equilibria wherein each good is integ...

0 Siddharth Barman, et al. ∙

research

∙ 07/11/2018

Fully Polynomial-Time Approximation Schemes for Fair Rent Division

We study the problem of fair rent division that entails splitting the re...

0 Eshwar Ram Arunachaleswaran, et al. ∙

research

∙ 04/25/2018

Fair Division Under Cardinality Constraints

We consider the problem of fairly allocating indivisible goods, among ag...

0 Siddharth Barman, et al. ∙

research

∙ 01/27/2018

Greedy Algorithms for Maximizing Nash Social Welfare

We study the problem of fairly allocating a set of indivisible goods amo...

0 Siddharth Barman, et al. ∙

research

∙ 11/21/2017

Groupwise Maximin Fair Allocation of Indivisible Goods

We study the problem of allocating indivisible goods among n agents in a...

0 Siddharth Barman, et al. ∙

Siddharth Barman

Featured Co-authors