Abstract

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

Publication Date

2007

Document Type

Thesis

Department, Program, or Center

Computer Science (GCCIS)

Advisor

Hemaspaandra, Edith - Chair

Advisor/Committee Member

Homan, Christopher

Advisor/Committee Member

Faliszewski, Piotr

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: JF1001 .R87 2007

Campus

RIT – Main Campus

Download

Share

COinS