research
∙
07/24/2023
On the complexity of Pareto-optimal and envy-free lotteries
We study the classic problem of dividing a collection of indivisible res...
share
research
∙
07/14/2023
Beyond the worst case: Distortion in impartial culture electorates
Distortion is a well-established notion for quantifying the loss of soci...
research
∙
11/08/2022
Computing better approximate pure Nash equilibria in cut games via semidefinite programming
Cut games are among the most fundamental strategic games in algorithmic ...
research
∙
07/04/2022
Repeatedly Matching Items to Agents Fairly and Efficiently
We consider a novel setting where a set of items are matched to the same...
research
∙
03/18/2022
Truthful Aggregation of Budget Proposals with Proportionality Guarantees
We study a participatory budgeting problem, where a set of strategic age...
research
∙
02/14/2022
Optimizing over Serial Dictatorships
Motivated by the success of the serial dictatorship mechanism in social ...
research
∙
01/31/2022
The Metric Distortion of Multiwinner Voting
We extend the recently introduced framework of metric distortion to mult...
research
∙
01/17/2022
Adjudication with Rational Jurors
We analyze a mechanism for adjudication involving majority voting and ra...
research
∙
01/12/2022
Beyond Cake Cutting: Allocating Homogeneous Divisible Goods
The problem of fair division known as "cake cutting" has been the focus ...
research
∙
10/01/2021
The Complexity of Learning Approval-Based Multiwinner Voting Rules
We study the PAC learnability of multiwinner voting, focusing on the cla...
research
∙
02/17/2021
Impartial selection with prior information
We study the problem of impartial selection, a topic that lies at the in...
research
∙
02/15/2021
On Interim Envy-Free Allocation Lotteries
With very few exceptions, recent research in fair division has mostly fo...
research
∙
07/16/2020
Simple posted pricing mechanisms for selling a divisible item
We study the problem of selling a divisible item to agents who have conc...
research
∙
02/06/2020
Computing envy-freeable allocations with limited subsidies
Fair division has emerged as a very hot topic in AI, and envy-freeness i...
research
∙
02/05/2020
Evaluating approval-based multiwinner voting in terms of robustness to noise
Approval-based multiwinner voting rules have recently received much atte...
research
∙
09/30/2019
Impartial Selection with Additive Approximation Guarantees
Impartial selection has recently received much attention within the mult...
research
∙
02/19/2019
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies
We consider the problem of the existence of natural improvement dynamics...
research
∙
02/18/2019
Stable fractional matchings
We study a generalization of the classical stable matching problem that ...
research
∙
02/12/2019
Envy-freeness up to any item with high Nash welfare: The virtue of donating items
Several fairness concepts have been proposed recently in attempts to app...
research
∙
08/28/2018
Almost Envy-Free Allocations with Connected Bundles
We study the existence of allocations of indivisible goods that are envy...
research
∙
07/27/2018
Fair allocation of combinations of indivisible goods and chores
We consider the problem of fairly dividing a set of items. Much of the f...
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
∙
09/18/2016
Optimizing positional scoring rules for rank aggregation
Nowadays, several crowdsourcing projects exploit social choice methods f...
research
∙
02/25/2016
How effective can simple ordinal peer grading be?
Ordinal peer grading has been proposed as a simple and scalable solution...
research
∙
02/13/2015
Efficiency and complexity of price competition among single-product vendors
Motivated by recent progress on pricing in the AI literature, we study m...
research
∙
11/17/2014