Strict Nanson

Violation of Strategy Proofness

Profile type: Profile
Config: 3 c, 5 v
Parameters: ∅

Violation of Strategy-Proofness for Strict Nanson under the single-winner set preference.
A voter can benefit by changing their ranking from (1, 0, 2) to (0, 2, 1).

Original Profile:
+---+---+---+
| 1 | 2 | 2 |
+---+---+---+
| 0 | 1 | 2 |
| 2 | 0 | 1 |
| 1 | 2 | 0 |
+---+---+---+
Profile([[0, 2, 1], [1, 0, 2], [2, 1, 0]], rcounts=[1, 2, 2], cmap={0: '0', 1: '1', 2: '2'})

Strict Nanson winner is {2}

New Profile:
+---+---+---+---+---+
| 1 | 1 | 1 | 1 | 1 |
+---+---+---+---+---+
| 0 | 1 | 2 | 2 | 0 |
| 2 | 0 | 1 | 1 | 2 |
| 1 | 2 | 0 | 0 | 1 |
+---+---+---+---+---+
Profile([[0, 2, 1], [1, 0, 2], [2, 1, 0], [2, 1, 0], [0, 2, 1]], rcounts=[1, 1, 1, 1, 1], cmap={0: '0', 1: '1', 2: '2'})

Strict Nanson winner is {0}