atlas

Research map / Learning theory and algorithms / Sample complexity

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

AAAI 2019 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of ranking and selection

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use a random voter to compare two other random voters’ favorite alternativesRandom Referee · General metric spacesSquared Distortion: 21; top-k only mechanisms have Ω(|𝒮|)Helped
Use a random voter to compare two other random voters’ favorite alternativesRandom Referee · Euclidean plane, d(u, pᵤ) = 0Distortion: 2 -> 1.97Helped
Use three favorite queries and select a repeated favorite when one occurs; otherwise choose among the three reported favoritesRandom Oligarchy · General metric spacesDistortion: ≤3Helped
Use Random Oligarchy instead of Random DictatorshipFavorite-only mechanisms · Small |𝒮|DistortionHelped
Use Random Oligarchy instead of 2-AgreeFavorite-only mechanisms · Large |𝒮|DistortionHelped
Restrict queries to top-k preferences rather than allowing comparisonsSocial choice mechanisms · General metric spacesSquared Distortion: Ω(|𝒮|)Hurt
Use only top-k queries instead of Random Referee’s comparison querySocial choice mechanisms · Euclidean plane, d(u, pᵤ) = 0Distortion: 2 vs. <1.97Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy