Anonymous user
River: Difference between revisions
correct links
imported>Heitzig-j mNo edit summary |
imported>Diego Santos (correct links) |
||
Line 10:
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-April/
* [http://lists.electorama.com/pipermail/election-methods-electorama.com/2004-April/
* [http://lists.electorama.com/pipermail/election-methods-electorama.com/2004-October/
* [http://lists.electorama.com/pipermail/election-methods-electorama.com/2004-October/
* [http://lists.electorama.com/pipermail/election-methods-electorama.com/2004-April/
River can be interpreted as a [[Minmax]] method, Minmax(non-cyclic pairwise loss) or MMNCPL. It is similar to Minmax(winning votes) except that River elects the candidate whose greatest ''non-cyclic'' pairwise loss to another candidate is least. As in [[Ranked Pairs]], the greatest pairwise loss (GPL) of each candidate is considered in order from largest (among all candidates) to smallest and locked. If a candidate's GPL is cyclic, it is discarded, and the next-greatest pairwise loss of that candidate is added to the list. When the non-cyclic greatest pairwise losses of (N-1) candidates have been locked, the remaining candidate is the winner.
| |||