research
∙
08/23/2023
On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores
We study the problem of allocating a group of indivisible chores among a...
share
research
∙
07/10/2023
One Quarter Each (on Average) Ensures Proportionality
We consider the problem of fair allocation of m indivisible items to a g...
research
∙
06/23/2023
Improved Competitive Ratios for Online Bipartite Matching on Degree Bounded Graphs
We consider the online bipartite matching problem on (k,d)-bounded graph...
research
∙
04/26/2023
Multi-agent Online Scheduling: MMS Allocations for Indivisible Items
We consider the problem of fairly allocating a sequence of indivisible i...
research
∙
02/11/2023
Improved Competitive Ratio for Edge-Weighted Online Stochastic Matching
We consider the edge-weighted online stochastic matching problem, in whi...
research
∙
01/19/2023
Weighted EF1 Allocations for Indivisible Chores
We study how to fairly allocate a set of indivisible chores to a group o...
research
∙
09/15/2021
