Defeat-dropping Condorcet methods: Difference between revisions
Content added Content deleted
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
[[Category:Condorcet methods]] |
[[Category:Condorcet methods]] |
||
These are [[Condorcet methods]] which, in the event of a [[Condorcet cycle|cycle]], can all be considered generalizations of [[Minimax]] to situations where there are more than 3 candidates |
These are [[Condorcet methods]] which, in the event of a [[Condorcet cycle|cycle]], can all be considered generalizations of [[Minimax]] to situations where there are more than 3 candidates. |
||
Revision as of 20:25, 21 February 2020
These are Condorcet methods which, in the event of a cycle, can all be considered generalizations of Minimax to situations where there are more than 3 candidates.