In this thesis, we discuss some existing and new results relating to computational aspects of voting. In particular, we consider, apparently for the first time, the computational complexity of the application of certain types of control to the Borda count voting system. We use control in the formal sense of attempts by an election's administrator to make a specific candidate win or lose by various means. We consider control problems for weighted elections, as well as for unweighted elections with voter preferences input both individually and in succinct representation.
Library of Congress Subject Headings
Voting--Mathematical models; Social choice--Mathematical models; Elections--Management; Elections--Corrupt practices
Department, Program, or Center
Computer Science (GCCIS)
Hemaspaandra, Edith - Chair
Russell, Nathan, "Complexity of control of Borda count elections" (2007). Thesis. Rochester Institute of Technology. Accessed from
RIT – Main Campus