Search Results for author:
Found 4 papers, 0 papers with code
Computing Voting Rules with Elicited Incomplete Votes
Motivated by the difficulty of specifying complete ordinal preferences over a large set of $m$ candidates, we study voting rules that are computable by querying voters about $t < m$ candidates.
The Optimal Size of an Epistemic Congress
We analyze the optimal size of a congress in a representative democracy.
Fair and Efficient Resource Allocation with Partial Information
We study the fundamental problem of allocating indivisible goods to agents with additive preferences.
Resolving the Optimal Metric Distortion Conjecture
We study the following metric distortion problem: there are two finite sets of points, $V$ and $C$, that lie in the same metric space, and our goal is to choose a point in $C$ whose total distance from the points in $V$ is as small as possible.
