Tragni's method: Difference between revisions
Added example
Aldo Tragni (talk | contribs) mNo edit summary |
Aldo Tragni (talk | contribs) (Added example) |
||
Line 85:
Wins C, the candidate who has least 0 (defeats) on his row (or the one that has most 1).
===Example===
Given the following vote: A[worst] B[1] C[2] D[3] E[4] F[5] G[best] the respective complete P Table is obtained:
{| class="wikitable"
|-
!
! A
! B
! C
! D
! E
! F
! G
|-
| A
|
| 1/5
| 1/5
| 1/5
| 1/5
| 1/5
| 1/5
|-
| B
| 5
|
| 1/2
| 1/3
| 1/4
| 1/5
| 1/5
|-
| C
| 5
| 2
|
| 2/3
| 2/4
| 2/5
| 1/5
|-
| D
| 5
| 3
| 3/2
|
| 3/4
| 3/5
| 1/5
|-
| E
| 5
| 4
| 4/2
| 4/3
|
| 4/5
| 1/5
|-
| F
| 5
| 5
| 5/2
| 5/3
| 5/4
|
| 1/5
|-
| G
| 5
| 5
| 5
| 5
| 5
| 5
|
|}
The propositions are all contained in [1/5, 5]. A [worst] always loses against everyone with 1/5, while G [best] always wins against everyone with 5. The voter will therefore be free to vote for his intermediate candidates without his vote changing the chances of victory of the [best] and [worst] candidates.
===Tie solutions===
| |||