research
∙
01/31/2023
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria
Fair allocation of indivisible goods has attracted extensive attention o...
share
research
∙
11/03/2022
Truthful Matching with Online Items and Offline Agents
We study truthful mechanisms for welfare maximization in online bipartit...
research
∙
07/07/2022
Prophet Inequalities via the Expected Competitive Ratio
We consider prophet inequalities under general downward-closed constrain...
research
∙
11/04/2021
Single-Sample Prophet Inequalities via Greedy-Ordered Selection
We study single-sample prophet inequalities (SSPIs), i.e., prophet inequ...
research
∙
09/17/2021
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
We consider the problem of fairly allocating a set of indivisible goods ...
research
∙
04/05/2021
Prophet Inequalities for Matching with a Single Sample
We consider the prophet inequality problem for (not necessarily bipartit...
research
∙
03/04/2021
An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem
In the weighted bipartite matching problem, the goal is to find a maximu...
research
∙
02/16/2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
The growing need to deal with massive instances motivates the design of ...
research
∙
07/09/2020
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Constrained submodular maximization problems encompass a wide variety of...
research
∙
03/17/2020
