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
∙
08/09/2023
Improved EFX Approximation Guarantees under Ordinal-based Assumptions
Our work studies the fair allocation of indivisible items to a set of ag...
research
∙
07/24/2023
As Time Goes By: Adding a Temporal Dimension Towards Resolving Delegations in Liquid Democracy
In recent years, the study of various models and questions related to Li...
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
∙
07/14/2022
A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games
Since the seminal PPAD-completeness result for computing a Nash equilibr...
research
∙
04/25/2022
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games
Since the celebrated PPAD-completeness result for Nash equilibria in bim...
research
∙
02/03/2022
Computational Aspects of Conditional Minisum Approval Voting in Elections with Interdependent Issues
Approval voting provides a simple, practical framework for multi-issue e...
research
∙
06/07/2021
Forward Looking Best-Response Multiplicative Weights Update Methods
We propose a novel variant of the multiplicative weights update method w...
research
∙
10/14/2019
Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond
We study mechanism design for combinatorial cost sharing. Imagine that m...
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/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
