A pairwise deliberation protocol with the weighted uncovered set achieves a tight metric distortion bound of 3, closing the gap for tournament rules.
Graph-theoreticalapproachestothetheoryofvoting.AmericanJournalofPolitical Science, 21(4):769–803
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Deliberation via Matching
A pairwise deliberation protocol with the weighted uncovered set achieves a tight metric distortion bound of 3, closing the gap for tournament rules.