In the metric distortion problem there is a set of candidates and a set ...
We study fair resource allocation with strategic agents. It is well-know...
We study the problem of designing voting rules that take as input the or...
We study the problem of allocating indivisible items to budget-constrain...
We design online algorithms for the fair allocation of public goods to a...
We study the problem faced by a data analyst or platform that wishes to
...
In their seminal paper that initiated the field of algorithmic mechanism...
A central goal in algorithmic game theory is to analyze the performance ...
In this work we introduce an alternative model for the design and analys...
In a single-parameter mechanism design problem, a provider is looking to...
The problem of fair division known as "cake cutting" has been the focus ...
We study the problem of selling a good to a group of bidders with
interd...
We revisit the well-studied problem of budget-feasible procurement, wher...
In a decentralized system with m machines, we study the selfish scheduli...
We study the classic problem of fairly allocating a set of indivisible g...
A set of divisible resources becomes available over a sequence of rounds...
We study the problem of fairly allocating indivisible goods and focus on...
We consider the problem of allocating a set of divisible goods to N agen...
We study the extent to which decentralized cost-sharing protocols can ac...
We study the following metric distortion problem: there are two finite s...
Many set selection and ranking algorithms have recently been enhanced wi...
We consider the design of randomized mechanisms for one-sided matching
m...