research
∙
09/11/2023
On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes
We study elections where voters are faced with the challenge of expressi...
share
research
∙
07/14/2023
Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents
Budget-feasible procurement has been a major paradigm in mechanism desig...
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...
research
∙
05/17/2022
Decentralised Update Selection with Semi-Strategic Experts
Motivated by governance models adopted in blockchain applications, we st...
research
∙
03/03/2022
Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond
In most social choice settings, the participating agents are typically r...
research
∙
02/15/2022
Fair Division of Indivisible Goods: A Survey
Allocating resources to individuals in a fair manner has been a topic of...
research
∙
10/18/2021
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals
The approximate uniform sampling of graphs with a given degree sequence ...
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
∙
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
∙
09/14/2020
A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching
We consider the one-sided matching problem, where n agents have preferen...
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
∙
01/27/2020
Maximum Nash Welfare and Other Stories About EFX
We consider the classic problem of fairly allocating indivisible goods a...
research
∙
09/17/2019
Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination
Several relaxations of envy-freeness, tailored to fair division in setti...
research
∙
07/18/2019
Peeking Behind the Ordinal Curtain: Improving Distortion via Cardinal Queries
Aggregating the preferences of individuals into a collective decision is...
research
∙
05/02/2019
Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online
The framework of budget-feasible mechanism design studies procurement au...
research
∙
07/01/2018
An Improved Envy-Free Cake Cutting Protocol for Four Agents
We consider the classic cake-cutting problem of producing envy-free allo...
research
∙
06/08/2018
Comparing Approximate Relaxations of Envy-Freeness
In fair division problems with indivisible goods it is well known that o...
research
∙
03/04/2018
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences
We show that the switch Markov chain for sampling simple undirected, as ...
research
∙
03/04/2018