research
∙
07/24/2023
Improving Approximation Guarantees for Maximin Share
We consider fair division of a set of indivisible goods among n agents w...
share
research
∙
07/14/2023
Breaking the 3/4 Barrier for Approximate Maximin Share
We study the fundamental problem of fairly allocating a set of indivisib...
research
∙
05/08/2023
Fair and Efficient Allocation of Indivisible Chores with Surplus
We study fair division of indivisible chores among n agents with additiv...
research
∙
03/29/2023
Simplification and Improvement of MMS Approximation
We consider the problem of fairly allocating a set of indivisible goods ...
research
∙
12/05/2022
Improving Fairness and Efficiency Guarantees for Allocating Indivisible Chores
We study the problem of fairly and efficiently allocating indivisible ch...
research
∙
11/07/2022
Approximating Nash Social Welfare by Matching and Local Search
For any ε>0, we give a simple, deterministic (6+ε)-approximation algorit...
research
∙
06/03/2022
Existence and Computation of Epistemic EFX
We consider the problem of allocating indivisible goods among n agents i...
research
∙
05/23/2022
Competitive Equilibrium with Chores: Combinatorial Algorithm and Hardness
We study the computational complexity of finding a competitive equilibri...
research
∙
05/16/2022
EFX Allocations: Simplifications and Improvements
The existence of EFX allocations is a fundamental open problem in discre...
research
∙
04/29/2022
Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods
We study the problem of fair and efficient allocation of a set of indivi...
research
∙
12/19/2021
Tractable Fragments of the Maximum Nash Welfare Problem
We study the problem of maximizing Nash welfare (MNW) while allocating i...
research
∙
10/18/2021
Fair and Efficient Allocations of Chores under Bivalued Preferences
We study the problem of fair and efficient allocation of a set of indivi...
research
∙
07/21/2021
On Fair and Efficient Allocations of Indivisible Public Goods
We study fair allocation of indivisible public goods subject to cardinal...
research
∙
07/12/2021
Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets
We study the equilibrium computation problem in the Fisher market model ...
research
∙
03/02/2021
Improving EFX Guarantees through Rainbow Cycle Number
We study the problem of fairly allocating a set of indivisible goods amo...
research
∙
03/02/2021
Trust in Social Network Games
We consider agents in a social network competing to be selected as partn...
research
∙
09/30/2020
Approximating Nash Social Welfare under Rado Valuations
We consider the problem of approximating maximum Nash social welfare (NS...
research
∙
09/22/2020
An Arrow-Debreu Extension of the Hylland-Zeckhauser Scheme: Equilibrium Existence and Algorithms
The Arrow-Debreu extension of the classic Hylland-Zeckhauser scheme for ...
research
∙
08/06/2020
Competitive Allocation of a Mixed Manna
We study the fair division problem of allocating a mixed manna under add...
research
∙
08/01/2020
Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores
We study the chore division problem where a set of agents needs to divid...
research
∙
05/13/2020
Fair and Efficient Allocations under Subadditive Valuations
We study the problem of allocating a set of indivisible goods among agen...
research
∙
02/12/2020
EFX Exists for Three Agents
We study the problem of allocating a set of indivisible items among agen...
research
∙
12/28/2019
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
We study the problem of approximating maximum Nash social welfare (NSW) ...
research
∙
08/21/2019
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands
We consider the exchange market models with divisible goods where the de...
research
∙
02/28/2019
An Improved Approximation Algorithm for Maximin Shares
We study the problem of fair allocation of m indivisible items among n a...
research
∙
12/11/2018
Fast Algorithms for Rank-1 Bimatrix Games
The rank of a bimatrix game is the matrix rank of the sum of the two pay...
research
∙
09/17/2018
A Strongly Polynomial Algorithm for Linear Exchange Markets
We present a strongly polynomial algorithm for computing an equilibrium ...
research
∙
05/16/2018
