Anonymous user
Sequential dropping: Difference between revisions
no edit summary
imported>KVenzke m (cat) |
imported>MarkusSchulze No edit summary |
||
Line 1:
'''Drop the weakest pairwise defeat ''that's in a cycle'' until a candidate is unbeaten.'''
Differs from minmax only in the "that's in a cycle" proviso. As a result of that proviso, sequential dropping is Smith-efficient. Unlike [[
[[Category:Condorcet method]]
|