Abstract
We calculate the proportion of preference profiles where “small” coalitions of agents may successfully manipulate any given scoring rule and show that it decreases to zero at a rate proportional to \(\frac{1}{\sqrt{n}}\) with the number of agents. If agents have to incur a small cost in order to decide how to manipulate the voting rule, our results imply that scoring rules are robust to such manipulation in large groups of agents. We present examples of asymptotically strategyproof and non strategyproof Condorcet consistent rules.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
