River: Difference between revisions
Content added Content deleted
imported>Araucaria No edit summary |
imported>Araucaria No edit summary |
||
| Line 1: | Line 1: | ||
River is a cloneproof monotonic [[Condorcet method]] with similarities to both [[Ranked Pairs]] and [[Cloneproof Schwartz Sequential Dropping]], but when cycles exist, can in rare cases find a different winner than either of the other two methods. |
River is a cloneproof monotonic [[Condorcet_method#Different_ambiguity_resolution_methods|Condorcet ambiguity resolution method]] with similarities to both [[Ranked Pairs]] and [[Cloneproof Schwartz Sequential Dropping]], but when cycles exist, can in rare cases find a different winner than either of the other two methods. |
||
It was first proposed by [[User:Heitzig-j|Jobst Heitzig]] on the election-methods mailing list: http://lists.electorama.com/pipermail/election-methods-electorama.com/2004-October/013971.html |
It was first proposed by [[User:Heitzig-j|Jobst Heitzig]] on the election-methods mailing list: http://lists.electorama.com/pipermail/election-methods-electorama.com/2004-October/013971.html |
||
Revision as of 22:56, 30 March 2005
River is a cloneproof monotonic Condorcet ambiguity resolution method with similarities to both Ranked Pairs and Cloneproof Schwartz Sequential Dropping, but when cycles exist, can in rare cases find a different winner than either of the other two methods.
It was first proposed by Jobst Heitzig on the election-methods mailing list: http://lists.electorama.com/pipermail/election-methods-electorama.com/2004-October/013971.html