|
Round
6
(ended)
Turn
6 - 31
(ended)
2006-11-19
22:19 CST
Not logged in
Home
Players
Public Forum
Judgments
Poker Tournament
Rules
Rule Changes
Proposals
History
Round 1
Round 2
Round 3
Round 4
Round 5
Current
|
|
|
All Rules
Index
217.1
Smith//Minmax, Ditto
|
Keywords
|
|
|
Text
|
There exists a voting system called Smith//Minmax. In Smith//Minmax, each player ranks all of the alternatives in a nonstrict ordering. That is, multiple alternatives may be given the same ranking. If the implementation provides for leaving alternatives unranked, unranked alternatives are considered to be ranked equal to each other and lower than all explicitly ranked candidates. Whether one candidate beats another is determined by comparing the rankings of those candidates in each ballot submitted; if A is ranked higher than B, then this counts as a vote for A beating B and against B beating A.
Define the Smith set to be the smallest non-empty set of candidates in a particular election who, when paired off in pairwise elections, can beat all other candidates outside the set. Eliminate all candidates not in the Smith set.
Define the loss-measure of a candidate to be the greatest margin by which that candidate is beaten by another candidate (in the Smith set). If the candidate is not beaten by any other candidate, its score is 0. The candidate with the lowest loss-measure wins. If more than one candidate is tied for lowest loss-measure, a random one of those candidates wins.
|
( 6 - 0: Initial [217.1])
|
