Anonymous user
SODA voting (Simple Optionally-Delegated Approval): Difference between revisions
SODA voting (Simple Optionally-Delegated Approval) (view source)
Revision as of 17:15, 20 June 2013
, 11 years ago→"Why go to the trouble of pre-announced rankings and a second round? Why not just have candidates pre-announce the approvals they will add to their delegated votes?" Because the best compromise is only clear after the votes are tallied.
imported>Homunq |
imported>Homunq |
||
Line 136:
=== "Why go to the trouble of pre-announced rankings and a second round? Why not just have candidates pre-announce the approvals they will add to their delegated votes?" Because the best compromise is only clear after the votes are tallied. ===
This sounds appealing, but would not work if two similar candidates were in a close race to see which had more first-choice votes, while an opponent stood ready to take advantage if they split the vote (that is, in the Chicken Dilemma, also discussed
In general, this system, because it provides perfect information on voting totals at the time when delegation is happening, will make strategy obvious. This has the paradoxical result that, as long as most voters agree with their favored candidate's chosen ranking order, this system will in practice be '''more Condorcet compliant than a Condorcet method''' (because strategy could confound a true Condorcet method more often than SODA).
|