A single proportional-to-power rule achieves optimal first-choice metric distortion 3-2/n, a unique instance-optimal rule exists, and an exact worst-case formula is derived for top-k voting.
Artificial Intelligence227, 190– 213 (2015)
1 Pith paper cite this work, alongside 144 external citations. Polarity classification is still indexing.
1
Pith paper citing it
144
external citations · OpenAlex
fields
cs.GT 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
New bounds on randomized metric distortion of top-$k$ voting
A single proportional-to-power rule achieves optimal first-choice metric distortion 3-2/n, a unique instance-optimal rule exists, and an exact worst-case formula is derived for top-k voting.