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...
share
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
∙
07/21/2021
On Fair and Efficient Allocations of Indivisible Public Goods
We study fair allocation of indivisible public goods subject to cardinal...
research
∙
06/16/2021
Memory Leak Detection Algorithms in the Cloud-based Infrastructure
A memory leak in an application deployed on the cloud can affect the ava...
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
∙
01/27/2019
Fair Division of Indivisible Goods Among Strategic Agents
We study fair division of indivisible goods in a single-parameter enviro...
research
∙
07/24/2018
