论文信息 - Vote trading and subset sums - 字舞流文

Vote trading and subset sums

We analyze the complexity of vote trading problems with equal-sized voting districts. For two allied vote-swapping parties, the problem is polynomially solvable. For three parties, the problem is NP-complete.

Gerhard J. Woeginger | Vincent Merlin | Sebastian Bervoets | G. Woeginger | V. Merlin | Sebastian Bervoets

[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2] Vincent Merlin,et al. Gerrymander-proof representative democracies , 2012, Int. J. Game Theory.

[3] Jan Karel Lenstra,et al. The mystical power of twoness : in memoriam Eugene L. Lawler , 1998 .

[4] David Hartvigsen,et al. Vote trading in public elections , 2006, Math. Soc. Sci..

[5] Marc J. Randazza. The Constitutionality of Online Vote Swapping , 2001 .

[6] Gerhard J. Woeginger,et al. Motion Planning with Pulley, Rope, and Baskets , 2013, Theory of Computing Systems.

[7] David Hartvigsen. The Manipulation of Voting Systems , 2008 .