论文信息 - How to Rig Elections and Competitions

How to Rig Elections and Competitions

We investigate the extent to which it is possible to rig the agenda of an election or competition so as to favor a particular candidate in the presence of imperfect information about the preferences of the electorate. We assume that what is known about an electorate is the probability that any given candidate will beat another. As well as presenting some analytical results relating to the complexity of finding and verifying agenda, we develop heuristics for agenda rigging, and investigate the performance of these heuristics for both randomly generated data and real-world data from tennis and basketball competitions.

[1] Donald T. Searls,et al. On the Probability of Winning with Different Tournament Procedures , 1963 .

[2] Hitoshi Matsushima,et al. Handbook of Social Choice and Welfare, Volume 1 (Book) , 2004 .

[3] Tuomas Sandholm,et al. Distributed rational decision making , 1999 .

[4] Toby Walsh,et al. Winner Determination in Sequential Majority Voting , 2007, IJCAI.

[5] P. Fishburn,et al. Voting Procedures , 2022 .

[6] Gregory Gutin,et al. On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs , 1999, Discret. Appl. Math..

[7] M. Trick,et al. The computational difficulty of manipulating an election , 1989 .

[8] Allen J. Schwenk,et al. What Is the Correct Way to Seed a Knockout Tournament? , 2000, Am. Math. Mon..

[9] Editors , 2003 .

[10] Michael A. Trick,et al. How hard is it to control an election? Math , 1992 .