F. Brandt, V. Conitzer & U. Endriss (2013):
Computational Social Choice.
In: G. Weiss: Multiagent Systems,
2nd edition.
MIT Press,
pp. 213–284.
F. Brandt, V. Conitzer, U. Endriss, J. Lang & A. Procaccia (2016):
Handbook of Computational Social Choice.
Cambridge University Press,
doi:10.1017/CBO9781107446984.
R. Bredereck, J. Chen, P. Faliszewski, A. Nichterlein & R. Niedermeier (2016):
Prices Matter for the Parameterized Complexity of Shift Bribery.
Information and Computation 251,
pp. 140–164,
doi:10.1016/j.ic.2016.08.003.
A. Borodin & R. El-Yaniv (1998):
Online Computation and Competitive Analysis.
Cambridge University Press.
J. Bartholdi, III, C. Tovey & M. Trick (1989):
The Computational Difficulty of Manipulating an Election.
Social Choice and Welfare 6(3),
pp. 227–241,
doi:10.1007/BF00295861.
A. Chandra, D. Kozen & L. Stockmeyer (1981):
Alternation.
Journal of ACM 26(1),
pp. 114–133,
doi:10.1145/322234.322243.
Y. Chevaleyre, J. Lang, N. Maudet, J. Monnot & L. Xia (2012):
New Candidates Welcome! Possible Winners with Respect to the Addition of New Candidates.
Mathematical Social Sciences 64(1),
pp. 74–88,
doi:10.1016/j.mathsocsci.2011.12.003.
V. Conitzer, T. Sandholm & J. Lang (2007):
When Are Elections with Few Candidates Hard to Manipulate?.
Journal of the ACM 54(3),
pp. Article 14,
doi:10.1145/1236457.1236461.
Y. Desmedt & E. Elkind (2010):
Equilibria of Plurality Voting with Abstentions.
In: Proceedings of the 11th ACM Conference on Electronic Commerce.
ACM Press,
pp. 347–356,
doi:10.1145/1807342.1807398.
E. Dekel & M. Piccione (2001):
Sequential Voting Procedures in Symmetric Binary Elections.
Journal of Political Economy 108(1),
pp. 34–55,
doi:10.1086/262110.
E. Elkind & P. Faliszewski (2010):
Approximation Algorithms for Campaign Management.
In: Proceedings of the 6th International Workshop On Internet And Network Economics,
pp. 473–482,
doi:10.1145/268999.269002.
E. Elkind, P. Faliszewski & A. Slinko (2009):
Swap Bribery.
In: Proceedings of the 2nd International Symposium on Algorithmic Game Theory.
Springer-Verlag Lecture Notes in Computer Science #5814,
pp. 299–310,
doi:10.1016/j.artint.2008.11.005.
P. Faliszewski (2008):
Nonuniform Bribery.
In: Proceedings of the 7th International Conference on Autonomous Agents and Multiagent Systems.
International Foundation for Autonomous Agents and Multiagent Systems,
pp. 1569–1572.
Z. Fitzsimmons & E. Hemaspaandra (2016):
High-Multiplicity Election Problems.
Technical Report arXiv:1611.08927 [cs.GT].
Computing Research Repository,
\voidb@x arXiv.org/corr/.
Revised, April 2019.
P. Faliszewski, E. Hemaspaandra & L. Hemaspaandra (2009):
How Hard Is Bribery in Elections?.
Journal of Artificial Intelligence Research 35,
pp. 485–532,
doi:10.1613/jair.2676.
Z. Fitzsimmons, E. Hemaspaandra & L. Hemaspaandra (2016):
Manipulation Complexity of Same-System Runoff Elections.
Annals of Mathematics and Artificial Intelligence 77(3–4),
pp. 159–189,
doi:10.1016/j.artint.2008.11.005.
J. Grollmann & A. Selman (1988):
Complexity Measures for Public-Key Cryptosystems.
SIAM Journal on Computing 17(2),
pp. 309–335,
doi:10.1137/0217018.
L. Hemaspaandra (2018):
Computational Social Choice and Computational Complexity: BFFs?.
In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence.
AAAI Press,
pp. 7971–7977.
E. Hemaspaandra, L. Hemaspaandra & J. Rothe (2014):
The Complexity of Online Manipulation of Sequential Elections.
Journal of Computer and System Sciences 80(4),
pp. 697–710,
doi:10.1016/j.jcss.2013.10.001.
E. Hemaspaandra, L. Hemaspaandra & J. Rothe (2017):
The Complexity of Controlling Candidate-Sequential Elections.
Theoretical Computer Science 678,
pp. 14–21,
doi:10.1016/j.tcs.2017.03.037.
E. Hemaspaandra, L. Hemaspaandra & J. Rothe (2017):
The Complexity of Online Voter Control in Sequential Elections.
Autonomous Agents and Multi-Agent Systems 31(5),
pp. 1055–1076,
doi:10.1007/s10458-016-9349-1.
E. Hemaspaandra, L. Hemaspaandra & J. Rothe (2019):
The Complexity of Online Bribery in Sequential Elections.
Technical Report arXiv:1906.08308 [cs.GT].
Computing Research Repository,
\voidb@x arXiv.org/corr/.
R. Ladner, N. Lynch & A. Selman (1975):
A Comparison of Polynomial Time Reducibilities.
Theoretical Computer Science 1(2),
pp. 103–124,
doi:10.1016/0304-3975(75)90016-X.
A. Meyer & L. Stockmeyer (1972):
The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space.
In: Proceedings of the 13th IEEE Symposium on Switching and Automata Theory.
IEEE Press,
pp. 125–129,
doi:10.1109/SWAT.1972.29.
D. Parkes & A. Procaccia (2013):
Dynamic Social Choice with Evolving Preferences.
In: Proceedings of the 27th AAAI Conference on Artificial Intelligence.
AAAI Press,
pp. 767–773.
K. Poole & H. Rosenthal (1997):
Congress: A Political-Economic History of Roll-Call Voting.
Oxford University Press.
J. Rothe (2016):
Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division.
Springer,
doi:10.1007/978-3-662-47904-9.
U. Schöning (1983):
A Low and a High Hierarchy within NP.
Journal of Computer and System Sciences 27(1),
pp. 14–28,
doi:10.1016/0022-0000(83)90027-2.
A. Selman (1982):
Reductions on NP and P-Selective Sets.
Theoretical Computer Science 19(3),
pp. 287–304,
doi:10.1016/0304-3975(82)90039-1.
B. Sloth (1993):
The Theory of Voting and Equilibria in Noncooperative Games.
Games and Economic Behavior 5(1),
pp. 152–169,
doi:10.1006/game.1993.1008.
L. Stockmeyer (1976):
The Polynomial-Time Hierarchy.
Theoretical Computer Science 3(1),
pp. 1–22,
doi:10.1016/0304-3975(76)90061-X.
M. Tennenholtz (2004):
Transitive Voting.
In: Proceedings of the 5th ACM Conference on Electronic Commerce.
ACM Press,
pp. 230–231,
doi:10.1145/988772.988808.
L. Xia & V. Conitzer (2010):
Stackelberg Voting Games: Computational Aspects and Paradoxes.
In: Proceedings of the 24th AAAI Conference on Artificial Intelligence.
AAAI Press,
pp. 697–702.
eptcs@eptcs.org