Computer Science – Computer Science and Game Theory
Scientific paper
2010-07-11
Computer Science
Computer Science and Game Theory
41 pages, 2 tables
Scientific paper
In 1992, Bartholdi, Tovey, and Trick opened the study of control attacks on elections---attempts to improve the election outcome by such actions as adding/deleting candidates or voters. That work has led to many results on how algorithms can be used to find attacks on elections and how complexity-theoretic hardness results can be used as shields against attacks. However, all the work in this line has assumed that the attacker employs just a single type of attack. In this paper, we model and study the case in which the attacker launches a multipronged (i.e., multimode) attack. We do so to more realistically capture the richness of real-life settings. For example, an attacker might simultaneously try to suppress some voters, attract new voters into the election, and introduce a spoiler candidate. Our model provides a unified framework for such varied attacks, and by constructing polynomial-time multiprong attack algorithms we prove that for various election systems even such concerted, flexible attacks can be perfectly planned in deterministic polynomial time.
Faliszewski Piotr
Hemaspaandra Edith
Hemaspaandra Lane A.
No associations
LandOfFree
Multimode Control Attacks on Elections does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Multimode Control Attacks on Elections, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multimode Control Attacks on Elections will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-695314