@incollection(bra-con-end:b:comsoc,
 author       = {F. Brandt and V. Conitzer and U. Endriss},
 year         = {2013},
 title        = {Computational Social Choice},
 editor       = {G. Weiss},
 booktitle    = {Multiagent Systems},
 edition      = {2nd},
 publisher    = {MIT Press},
 pages        = {213--284},
)
@book(bra-con-end-lan-pro:b:handook-of-comsoc,
 editor       = {F. Brandt and V. Conitzer and U. Endriss and J. Lang and A. Procaccia},
 year         = {2016},
 title        = {Handbook of Computational Social Choice},
 publisher    = {Cambridge University Press},
 doi          = {10.1017/CBO9781107446984},
)
@article(bre-che-fal-nic-nie:j:prices-matter-shift-bribery,
 author       = {R. Bredereck and J. Chen and P. Faliszewski and A. Nichterlein and R. Niedermeier},
 year         = {2016},
 title        = {Prices Matter for the Parameterized Complexity of Shift Bribery},
 journal      = {Information and Computation},
 volume       = {251},
 pages        = {140--164},
 doi          = {10.1016/j.ic.2016.08.003},
)
@book(bor-ely:b:online-algorithms,
 author       = {A. Borodin and {El-Yaniv}, R.},
 year         = {1998},
 title        = {Online Computation and Competitive Analysis},
 publisher    = {Cambridge University Press},
)
@article(bar-tov-tri:j:manipulating,
 author       = {J. {{Bartholdi}}, III and C. Tovey and M. Trick},
 year         = {1989},
 title        = {The Computational Difficulty of Manipulating an Election},
 journal      = {Social Choice and Welfare},
 volume       = {6},
 number       = {3},
 pages        = {227--241},
 doi          = {10.1007/BF00295861},
)
@article(cha-koz-sto:j:alternation,
 author       = {A. Chandra and D. Kozen and L. Stockmeyer},
 year         = {1981},
 title        = {Alternation},
 journal      = {Journal of ACM},
 volume       = {26},
 number       = {1},
 pages        = {114--133},
 doi          = {10.1145/322234.322243},
)
@article(che-lan-mau-mon-xia:j:possible-winners-adding-welcome,
 author       = {Y. Chevaleyre and J. Lang and N. Maudet and J. Monnot and L. Xia},
 year         = {2012},
 title        = {New Candidates Welcome! {Possible} Winners with Respect to the Addition of New Candidates},
 journal      = {Mathematical Social Sciences},
 volume       = {64},
 number       = {1},
 pages        = {74--88},
 doi          = {10.1016/j.mathsocsci.2011.12.003},
)
@article(con-lan-san:j:when-hard-to-manipulate,
 author       = {V. Conitzer and T. Sandholm and J. Lang},
 year         = {2007},
 title        = {When Are Elections with Few Candidates Hard to Manipulate?},
 journal      = {Journal of the ACM},
 volume       = {54},
 number       = {3},
 pages        = {Article~14},
 doi          = {10.1145/1236457.1236461},
)
@inproceedings(des-elk:c:sequential-voting,
 author       = {Y. Desmedt and E. Elkind},
 year         = {2010},
 title        = {Equilibria of Plurality Voting with Abstentions},
 booktitle    = {Proceedings of the 11th ACM Conference on Electronic Commerce},
 publisher    = {ACM Press},
 pages        = {347--356},
 doi          = {10.1145/1807342.1807398},
)
@article(dek-pic:j:sequential-voting-binary-elections,
 author       = {E. Dekel and M. Piccione},
 year         = {2001},
 title        = {Sequential Voting Procedures in Symmetric Binary Elections},
 journal      = {Journal of Political Economy},
 volume       = {108},
 number       = {1},
 pages        = {34--55},
 doi          = {10.1086/262110},
)
@inproceedings(elk-fal:c:shift-bribery,
 author       = {E. Elkind and P. Faliszewski},
 year         = {2010},
 title        = {Approximation Algorithms for Campaign Management},
 booktitle    = {Proceedings of the 6th International Workshop On Internet And Network Economics},
 pages        = {473--482},
 doi          = {10.1145/268999.269002},
)
@inproceedings(elk-fal-sli:c:swap-bribery,
 author       = {E. Elkind and P. Faliszewski and A. Slinko},
 year         = {2009},
 title        = {Swap Bribery},
 booktitle    = {Proceedings of the 2nd International Symposium on Algorithmic Game Theory},
 publisher    = {Springer-Verlag {Lecture Notes in Computer Science \#5814}},
 pages        = {299--310},
 doi          = {10.1016/j.artint.2008.11.005},
)
@inproceedings(fal:c:nonuniform-bribery,
 author       = {P. Faliszewski},
 year         = {2008},
 title        = {Nonuniform Bribery},
 booktitle    = {Proceedings of the 7th International Conference on Autonomous Agents and Multiagent Systems},
 publisher    = {International Foundation for Autonomous Agents and Multiagent Systems},
 pages        = {1569--1572},
)
@techreport(fit-hem:t:succinct,
 author       = {Z. Fitzsimmons and E. Hemaspaandra},
 year         = {2016},
 title        = {High-Multiplicity Election Problems},
 type         = {Technical Report},
 number       = {arXiv:1611.08927~[cs.GT]},
 institution  = {Computing Research Repository},
 address      = {\unhbox\voidb@x \hbox{arXiv.org/corr/}},
 note         = {Revised, April 2019},
)
@article(fal-hem-hem:j:bribery,
 author       = {P. Faliszewski and E. Hemaspaandra and L. Hemaspaandra},
 year         = {2009},
 title        = {How Hard Is Bribery in Elections?},
 journal      = {Journal of Artificial Intelligence Research},
 volume       = {35},
 pages        = {485--532},
 doi          = {10.1613/jair.2676},
)
@article(fit-hem-hem:j:xthenx,
 author       = {Z. Fitzsimmons and E. Hemaspaandra and L. Hemaspaandra},
 year         = {2016},
 title        = {Manipulation Complexity of Same-System Runoff Elections},
 journal      = {Annals of Mathematics and Artificial Intelligence},
 volume       = {77},
 number       = {3--4},
 pages        = {159--189},
 doi          = {10.1016/j.artint.2008.11.005},
)
@article(gro-sel:j:complexity-measures,
 author       = {J. Grollmann and A. Selman},
 year         = {1988},
 title        = {Complexity Measures for Public-Key Cryptosystems},
 journal      = {SIAM Journal on Computing},
 volume       = {17},
 number       = {2},
 pages        = {309--335},
 doi          = {10.1137/0217018},
)
@inproceedings(hem:c:bffs,
 author       = {L. Hemaspaandra},
 year         = {2018},
 title        = {Computational Social Choice and Computational Complexity: {BFFs}?},
 booktitle    = {Proceedings of the 32nd AAAI Conference on Artificial Intelligence},
 publisher    = {AAAI Press},
 pages        = {7971--7977},
)
@article(hem-hem-rot:j:online-manipulation,
 author       = {E. Hemaspaandra and L. Hemaspaandra and J. Rothe},
 year         = {2014},
 title        = {The Complexity of Online Manipulation of Sequential Elections},
 journal      = {Journal of Computer and System Sciences},
 volume       = {80},
 number       = {4},
 pages        = {697--710},
 doi          = {10.1016/j.jcss.2013.10.001},
)
@article(hem-hem-rot:j:online-candidate-control,
 author       = {E. Hemaspaandra and L. Hemaspaandra and J. Rothe},
 year         = {2017},
 title        = {The Complexity of Controlling Candidate-Sequential Elections},
 journal      = {Theoretical Computer Science},
 volume       = {678},
 pages        = {14--21},
 doi          = {10.1016/j.tcs.2017.03.037},
)
@article(hem-hem-rot:j:online-voter-control,
 author       = {E. Hemaspaandra and L. Hemaspaandra and J. Rothe},
 year         = {2017},
 title        = {The Complexity of Online Voter Control in Sequential Elections},
 journal      = {Autonomous Agents and Multi-Agent Systems},
 volume       = {31},
 number       = {5},
 pages        = {1055--1076},
 doi          = {10.1007/s10458-016-9349-1},
)
@techreport(hem-hem-rot:t:online-bribery,
 author       = {E. Hemaspaandra and L. Hemaspaandra and J. Rothe},
 year         = {2019},
 title        = {The Complexity of Online Bribery in Sequential Elections},
 type         = {Technical Report},
 number       = {arXiv:1906.08308~[cs.GT]},
 institution  = {Computing Research Repository},
 address      = {\unhbox\voidb@x \hbox{arXiv.org/corr/}},
)
@article(lad-lyn-sel:j:com,
 author       = {R. Ladner and N. Lynch and A. Selman},
 year         = {1975},
 title        = {A Comparison of Polynomial Time Reducibilities},
 journal      = {Theoretical Computer Science},
 volume       = {1},
 number       = {2},
 pages        = {103--124},
 doi          = {10.1016/0304-3975(75)90016-X},
)
@inproceedings(mey-sto:c:reg-exp-needs-exp-space,
 author       = {A. Meyer and L. Stockmeyer},
 year         = {1972},
 title        = {The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space},
 booktitle    = {Proceedings of the 13th IEEE Symposium on Switching and Automata Theory},
 publisher    = {IEEE Press},
 pages        = {125--129},
 doi          = {10.1109/SWAT.1972.29},
)
@inproceedings(par-pro:c:dynamic-social-choice,
 author       = {D. Parkes and A. Procaccia},
 year         = {2013},
 title        = {Dynamic Social Choice with Evolving Preferences},
 booktitle    = {Proceedings of the 27th AAAI Conference on Artificial Intelligence},
 publisher    = {AAAI Press},
 pages        = {767--773},
)
@book(poo-ros:b:congress,
 author       = {K. Poole and H. Rosenthal},
 year         = {1997},
 title        = {Congress: {A} Political-Economic History of Roll-Call Voting},
 publisher    = {Oxford University Press},
)
@book(rot:b:econ,
 editor       = {J. Rothe},
 year         = {2016},
 title        = {Economics and Computation: {An} Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division},
 publisher    = {Springer},
 doi          = {10.1007/978-3-662-47904-9},
)
@article(sch:j:low,
 author       = {U. Sch{\"{o}}ning},
 year         = {1983},
 title        = {A Low and a High Hierarchy within {N}{P}},
 journal      = {Journal of Computer and System Sciences},
 volume       = {27},
 number       = {1},
 pages        = {14--28},
 doi          = {10.1016/0022-0000(83)90027-2},
)
@article(sel:j:reductions-pselective,
 author       = {A. Selman},
 year         = {1982},
 title        = {Reductions on {N}{P} and {P}-Selective Sets},
 journal      = {Theoretical Computer Science},
 volume       = {19},
 number       = {3},
 pages        = {287--304},
 doi          = {10.1016/0304-3975(82)90039-1},
)
@article(slo:j:sequential-voting,
 author       = {B. Sloth},
 year         = {1993},
 title        = {The Theory of Voting and Equilibria in Noncooperative Games},
 journal      = {Games and Economic Behavior},
 volume       = {5},
 number       = {1},
 pages        = {152--169},
 doi          = {10.1006/game.1993.1008},
)
@article(sto:j:poly,
 author       = {L. Stockmeyer},
 year         = {1976},
 title        = {The Polynomial-Time Hierarchy},
 journal      = {Theoretical Computer Science},
 volume       = {3},
 number       = {1},
 pages        = {1--22},
 doi          = {10.1016/0304-3975(76)90061-X},
)
@inproceedings(ten:c:transitive-voting,
 author       = {M. Tennenholtz},
 year         = {2004},
 title        = {Transitive Voting},
 booktitle    = {Proceedings of the 5th ACM Conference on Electronic Commerce},
 publisher    = {ACM Press},
 pages        = {230--231},
 doi          = {10.1145/988772.988808},
)
@inproceedings(con-xia:c:stackelberg-sequential,
 author       = {L. Xia and V. Conitzer},
 year         = {2010},
 title        = {Stackelberg Voting Games: {Computational} Aspects and Paradoxes},
 booktitle    = {Proceedings of the 24th AAAI Conference on Artificial Intelligence},
 publisher    = {AAAI Press},
 pages        = {697--702},
)