research
∙
05/08/2023
Learning Good Interventions in Causal Graphs via Covering
We study the causal bandit problem that entails identifying a near-optim...
share
research
∙
05/02/2023
Guaranteeing Envy-Freeness under Generalized Assignment Constraints
We study fair division of goods under the broad class of generalized ass...
research
∙
02/22/2023
Fair Chore Division under Binary Supermodular Costs
We study the problem of dividing indivisible chores among agents whose c...
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...
research
∙
08/17/2022
Finding Fair Allocations under Budget Constraints
We study the fair allocation of indivisible goods among agents with iden...
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...
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...
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...
research
∙
11/01/2021
Intervention Efficient Algorithm for Two-Stage Causal MDPs
We study Markov Decision Processes (MDP) wherein states correspond to ca...
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...
research
∙
09/13/2021
Truthful and Fair Mechanisms for Matroid-Rank Valuations
We study the problem of allocating indivisible goods among strategic age...
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 ...
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...
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...
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...
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...
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...
research
∙
05/31/2020
Fair Cake Division Under Monotone Likelihood Ratios
This work develops algorithmic results for the classic cake-cutting prob...
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...
research
∙
05/01/2020
Uniform Welfare Guarantees Under Identical Subadditive Valuations
We study the problem of allocating indivisible goods among agents that h...
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...
research
∙
07/25/2019
Fair and Efficient Cake Division with Connected Pieces
The classic cake-cutting problem provides a model for addressing fair an...
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...
research
∙
05/02/2019
Tight Approximation Bounds for Maximum Multi-Coverage
In the classic maximum coverage problem, we are given subsets T_1, ..., ...
research
∙
01/27/2019
Fair Division of Indivisible Goods Among Strategic Agents
We study fair division of indivisible goods in a single-parameter enviro...
research
∙
11/27/2018
Fair Division with a Secretive Agent
We study classic fair-division problems in a partial information setting...
research
∙
11/21/2018
On the Proximity of Markets with Integral Equilibria
We study Fisher markets that admit equilibria wherein each good is integ...
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...
research
∙
04/25/2018
Fair Division Under Cardinality Constraints
We consider the problem of fairly allocating indivisible goods, among ag...
research
∙
01/27/2018
Greedy Algorithms for Maximizing Nash Social Welfare
We study the problem of fairly allocating a set of indivisible goods amo...
research
∙
11/21/2017
