Dodgson's method: Difference between revisions
m
Fishburn's variant can be computed in polytime
m (Clarify bubble sort metric) |
m (Fishburn's variant can be computed in polytime) |
||
(One intermediate revision by the same user not shown) | |||
Line 6:
==Criterion compliances==
Dodgson's method passes the Condorcet criterion. It fails the [[
P. C. Fishburn proposed a variant that passes homogeneity<ref name="PCFishburn" /> and where the winner can be found in polynomial time,<ref>{{Cite journal|last=Rothe|first=Jörg|last2=Spakowski|first2=Holger|last3=Vogel|first3=Jörg|date=2003-08-01|title=Exact Complexity of the Winner Problem for Young Elections|url=https://arxiv.org/pdf/cs/0112021|journal=Theory of Computing Systems|language=en|volume=36|issue=4|pages=375–386|doi=10.1007/s00224-002-1093-z|issn=1433-0490|via=}}</ref> but the variant fails the other three criteria mentioned above.
==References==
<references />
[[Category:Condorcet methods]]
|