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
∙
09/11/2023
Truthful Interval Covering
We initiate the study of a novel problem in mechanism design without mon...
research
∙
05/23/2023
Improved Metric Distortion via Threshold Approvals
We consider a social choice setting in which agents and alternatives are...
research
∙
01/09/2023
Revisiting the Distortion of Distributed Voting
We consider a setting with agents that have preferences over alternative...
research
∙
01/04/2023
Settling the Distortion of Distributed Facility Location
We study the distributed facility location problem, where a set of agent...
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
∙
11/12/2021
FIXP-membership via Convex Optimization: Games, Cakes, and Markets
We introduce a new technique for proving membership of problems in FIXP ...
research
∙
07/12/2021
The Distortion of Distributed Metric Social Choice
We consider a social choice setting with agents that are partitioned int...
research
∙
06/10/2021
Achieving Diverse Objectives with AI-driven Prices in Deep Reinforcement Learning Multi-agent Markets
We propose a practical approach to computing market prices and allocatio...
research
∙
06/07/2021
Mechanism Design for Facility Location Problems: A Survey
The study of approximate mechanism design for facility location problems...
research
∙
05/06/2021
Heterogeneous Facility Location with Limited Resources
We initiate the study of the heterogeneous facility location problem wit...
research
∙
03/04/2021
On the Complexity of Equilibrium Computation in First-Price Auctions
We consider the problem of computing a (pure) Bayes-Nash equilibrium in ...
research
∙
03/01/2021
Distortion in Social Choice Problems: The First 15 Years and Beyond
The notion of distortion in social choice problems has been defined to m...
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/29/2020
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents
We consider the ε-Consensus-Halving problem, in which a set of heterogen...
research
∙
07/13/2020
Approximate mechanism design for distributed facility location
We consider the distributed facility location problem, in which there is...
research
∙
03/26/2020
A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting
The classes PPA-p have attracted attention lately, because they are the ...
research
∙
02/26/2020
Consensus-Halving: Does it Ever Get Easier?
In the ε-Consensus-Halving problem, a fundamental problem in fair divisi...
research
∙
02/26/2020
Consenus-Halving: Does it Ever Get Easier?
In the ε-Consensus-Halving problem, a fundamental problem in fair divisi...
research
∙
01/27/2020
Maximum Nash Welfare and Other Stories About EFX
We consider the classic problem of fairly allocating indivisible goods a...
research
∙
12/17/2019
Putting Ridesharing to the Test: Efficient and Scalable Solutions and the Power of Dynamic Vehicle Relocation
Ridesharing is a coordination problem in its core. Traditionally it has ...
research
∙
08/30/2019
Rewarding High-Quality Data via Influence Functions
We consider a crowdsourcing data acquisition scenario, such as federated...
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/06/2019
The distortion of distributed voting
Voting can abstractly model any decision-making scenario and as such it ...
research
∙
02/25/2019
Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior
We present a novel anytime heuristic (ALMA), inspired by the human princ...
research
∙
02/18/2019
Stable fractional matchings
We study a generalization of the classical stable matching problem that ...
research
∙
09/10/2018
The Pareto Frontier of Inefficiency in Mechanism Design
We study the trade-off between the Price of Anarchy (PoA) and the Price ...
research
∙
06/04/2018
On the computational complexity of blind detection of binary linear codes
In this work, we study the computational complexity of the Minimum Dista...
research
∙
05/31/2018
The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches
We resolve the computational complexity of two problems known as NECKLAC...
research
∙
02/05/2018
Truthful mechanisms for ownership transfer with expert advice
When a company undergoes a merger or transfer of its ownership, the exis...
research
∙
12/24/2017
Walrasian Dynamics in Multi-unit Markets
In a multi-unit market, a seller brings multiple units of a good and tri...
research
∙
11/13/2017
Consensus Halving is PPA-Complete
We show that the computational problem CONSENSUS-HALVING is PPA-complete...
research
∙
08/25/2017
Reinforcement Mechanism Design for e-commerce
We study the problem of allocating impressions to sellers in e-commerce ...
research
∙
08/25/2017
