Manipulative agendas in four-candidate elections

摘要

We consider a setting where it is known for an electorate what probability a given candidate has of beating another in a pairwise ballot. An agenda assigns candidates to the leaves of a binary tree and is called manipulative if it inverts the final winning probabilities for two candidates. We compare standard and symmetric agendas in four-candidate elections and show that in monotone environments the former are more manipulative. (c) 2020 Elsevier B.V. All rights reserved.