research
∙
01/27/2023
A proof of the Nisan-Ronen conjecture
Noam Nisan and Amir Ronen conjectured that the best approximation ratio ...
share
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
∙
06/07/2021
Truthful allocation in graphs and hypergraphs
We study truthful mechanisms for allocation problems in graphs, both for...
research
∙
04/22/2021
HINT: A Hierarchical Index for Intervals in Main Memory
Indexing intervals is a fundamental problem, finding a wide range of app...
research
∙
02/17/2021
Impartial selection with prior information
We study the problem of impartial selection, a topic that lies at the in...
research
∙
11/29/2020
On the Nisan-Ronen conjecture
The Nisan-Ronen conjecture states that no truthful mechanism for makespa...
research
∙
07/07/2020
Resource-Aware Protocols for Network Cost-Sharing Games
We study the extent to which decentralized cost-sharing protocols can ac...
research
∙
02/18/2020
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games
We study the existence of approximate pure Nash equilibria (α-PNE) in we...
research
∙
09/30/2019
Impartial Selection with Additive Approximation Guarantees
Impartial selection has recently received much attention within the mult...
research
∙
07/30/2019
On the Nisan-Ronen conjecture for submodular valuations
We consider incentive compatible mechanisms for a domain that is very cl...
research
∙
10/10/2018
Strategic Contention Resolution in Multiple Channels
We consider the problem of resolving contention in communication network...
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
∙
02/27/2018
