paper-with-me

Papers

Random Dictators with a Random Referee: Constant Sample Complexity Mechanisms for Social Choice

2018-11-12 · Brandon Fain, Ashish Goel, Kamesh Munagala, Nina Prabhu

We study social choice mechanisms in an implicit utilitarian framework with a metric constraint, where the goal is to minimize \textit{Distortion}, the worst case social cost of an ordinal mechanism relative to underlying cardinal utilities. We consider two additional desiderata: Constant sample complexity and Squared Distortion. Constant sample complexity means that the mechanism (potentially randomized) only uses a constant number of ordinal queries regardless of the number of voters and alternatives. Squared Distortion is a measure of variance of the Distortion of a randomized mechanism. Our primary contribution is the first social choice mechanism with constant sample complexity \textit{and} constant Squared Distortion (which also implies constant Distortion). We call the mechanism Random Referee, because it uses a random agent to compare two alternatives that are the favorites of two other random agents. We prove that the use of a comparison query is necessary: no mechanism that only elicits the top-k preferred alternatives of voters (for constant k) can have Squared Distortion that is sublinear in the number of alternatives. We also prove that unlike any top-k only mechanism, the Distortion of Random Referee meaningfully improves on benign metric spaces, using the Euclidean plane as a canonical example. Finally, among top-1 only mechanisms, we introduce Random Oligarchy. The mechanism asks just 3 queries and is essentially optimal among the class of such mechanisms with respect to Distortion. In summary, we demonstrate the surprising power of constant sample complexity mechanisms generally, and just three random voters in particular, to provide some of the best known results in the implicit utilitarian framework.

📄 PDF Abstract BibTeX arXiv:1811.04786

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Relaxed Notions of Condorcet-Consistency and Efficiency for Strategyproof Social Decision Schemes

2022-01-25 · Felix Brandt, Patrick Lederer, René Romen

Social decision schemes (SDSs) map the preferences of a group of voters over some set of $m$ alternatives to a probability distribution over the alternatives. A seminal characterization of strategyproof SDSs by Gibbard i…

Paired Course and Dorm Allocation

2025-01-05 · Eric Gao

Consider a university administrator who must assign students to both courses and dorms and runs (random) serial dictatorship independently in each market. While serial dictatorship is efficient for each individual matchi…

Stability and Efficiency of Random Serial Dictatorship

2021-10-13 · Suhas Vijaykumar

This paper establishes non-asymptotic convergence of the cutoffs in Random serial dictatorship in an environment with many students, many schools, and arbitrary student preferences. Convergence is shown to hold when the …

Towards a Characterization of Random Serial Dictatorship

2023-03-21 · Felix Brandt, Matthias Greger, René Romen

Random serial dictatorship (RSD) is a randomized assignment rule that - given a set of $n$ agents with strict preferences over $n$ houses - satisfies equal treatment of equals, ex post efficiency, and strategyproofness. …

Self-Equivalent Voting Rules

2025-06-18 · Héctor Hermida-Rivera

In this paper, I introduce a novel stability axiom for stochastic voting rules, called self-equivalence, by which a society considering whether to replace its voting rule using itself will choose not do so. I then show t…