“Resolvability criterion”的意思、由来-开放百科全书

词条

Resolvability criterion

释义

References

Resolvability criterion can refer to any voting system criterion that ensures a low possibility of tie votes.

In Nicolaus Tideman's version of the criterion, for every (possibly tied) winner in a result, there must exist a way for one added vote to make that winner unique.
Douglas R. Woodall's version requires that the proportion of profiles giving a tie approaches zero as the number of voters increases toward infinity.

Methods that satisfy both versions include approval voting, range voting, Borda count, instant-runoff voting, minimax Condorcet, plurality, Tideman's ranked pairs,^[1] and Schulze.^[2]

Methods that violate both versions include Copeland's method and the Slater rule.{{fact|date=February 2013}}

References

1. ^{{Cite web|url=http://alumnus.caltech.edu/~seppley/Proof%20MAM%20is%20resolvable%20and%20reasonably%20deterministic.htm|title=Proof MAM is resolvable and reasonably deterministic|website=alumnus.caltech.edu|access-date=2018-07-21}}
2. ^{{Cite web|url=http://m-schulze.9mail.de/schulze1.pdf|title=A New Monotonic, Clone-Independent, Reversal Symmetric, and Condorcet-Consistent Single-Winner Election Method|last=Schulze|first=Markus|date=3 March 2017|website=|archive-url=|archive-date=|dead-url=|access-date=}}

1 : Electoral system criteria

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。