[EM] Manipulation Resistant Voting
suzerainsimmons at outlook.com
Fri Jul 16 19:58:44 PDT 2021
It is well known that there is no incentive for dishonest voting when the method is to elect the candidate indicated on a randomly chosen secret ballot.
Is there also a manipulation free deterministic method?
Here's one that satisfies the Condorcet Criterion when voters are rational and informed about the preferences of other voters.
The ballot is a binary decision tree with the root node at the top and the leaves marked with the names of the candidates at the bottom.
The voters mark each node to indicate their preferred decision, whether left branch or right.
A path is traced from the top to the bottom, choosing left or right at each node according to which choice is supported by by the preponderance of voters at that node.
The name marked on the leaf at the end of the path indicates the winning candidate.
When not sure, voters may copy published recommendations.
There is absolutely zero incentive to vote left at a node where you prefer the likely winner of the right branch.
So what is the catch? The catch is that it is not easy to construct a decision tree that is clone independent. Furthermore, if the tree is constructed on the basis of ballot ratings or rankings, those ballots will be subject to manipulation to secure a more favorable tree.
Is there a neutral process for constructing a clone-free decision tree?
... to be continued ...
Sent from my MetroPCS 4G LTE Android Device
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Election-Methods