Distributed Score Voting: Difference between revisions
Content added Content deleted
No edit summary |
No edit summary |
||
Line 158: | Line 158: | ||
<b>IIA*</b>: X is a set containing all the preferred candidates over B. If I add C a less appreciated candidate (in head-to-head) than the candidates in X, then all candidates in X continue to be preferred over B. |
<b>IIA*</b>: X is a set containing all the preferred candidates over B. If I add C a less appreciated candidate (in head-to-head) than the candidates in X, then all candidates in X continue to be preferred over B. |
||
This method also passes [[ISDA]]. |
|||
All the criteria not met are linked to the fact that, through tactical votes, it's possible add / remove a candidate from the [[Smith set]]. |
All the criteria not met are linked to the fact that, through tactical votes, it's possible add / remove a candidate from the [[Smith set]]. |
||
Line 180: | Line 182: | ||
* the new winner is actually a better candidate than the previous one (the new winner in the example could also be C). |
* the new winner is actually a better candidate than the previous one (the new winner in the example could also be C). |
||
* the voter has a fairly precise knowledge of the likely ballots result, without which this tactical vote would turn against him. |
* the voter has a fairly precise knowledge of the likely ballots result, without which this tactical vote would turn against him. |
||
[[Category:Smith-efficient Condorcet methods]] |