English

Dodgson's Rule Approximations and Absurdity

Combinatorics 2010-08-10 v1 Computer Science and Game Theory

Abstract

With the Dodgson rule, cloning the electorate can change the winner, which Young (1977) considers an "absurdity". Removing this absurdity results in a new rule (Fishburn, 1977) for which we can compute the winner in polynomial time (Rothe et al., 2003), unlike the traditional Dodgson rule. We call this rule DC and introduce two new related rules (DR and D&). Dodgson did not explicitly propose the "Dodgson rule" (Tideman, 1987); we argue that DC and DR are better realizations of the principle behind the Dodgson rule than the traditional Dodgson rule. These rules, especially D&, are also effective approximations to the traditional Dodgson's rule. We show that, unlike the rules we have considered previously, the DC, DR and D& scores differ from the Dodgson score by no more than a fixed amount given a fixed number of alternatives, and thus these new rules converge to Dodgson under any reasonable assumption on voter behaviour, including the Impartial Anonymous Culture assumption.

Cite

@article{arxiv.1008.1501,
  title  = {Dodgson's Rule Approximations and Absurdity},
  author = {John C. McCabe-Dansted},
  journal= {arXiv preprint arXiv:1008.1501},
  year   = {2010}
}

Comments

Expanded draft of paper presented at COMSOC 2008

R2 v1 2026-06-21T15:58:34.741Z