Cognitive hierarchy and voting manipulation in k-approval voting
Math. Soc. Sci., pp. 193-205, 2020.
Abstract By the Gibbard–Satterthwaite theorem, every reasonable voting rule for three or more alternatives is susceptible to manipulation: there exist elections where one or more voters can change the election outcome in their favour by unilaterally modifying their vote. When a given election admits several such voters, strategic voting...More
Full Text (Upload PDF)
PPT (Upload PPT)