Hybrid Elections Broaden Complexity-Theoretic Resistance to Control

Simple item page
dc.creatorHemaspaandra, Edith
dc.creatorHemaspaandra, Lane A.
dc.creatorRothe, Joerg
dc.date2006-08-14
dc.date2008-09-26
dc.date.accessioned2026-07-07T10:05:22Z
dc.date.available2026-07-07T10:05:22Z
dc.descriptionElectoral control refers to attempts by an election's organizer ("the chair") to influence the outcome by adding/deleting/partitioning voters or candidates. The groundbreaking work of Bartholdi, Tovey, and Trick [BTT92] on (constructive) control proposes computational complexity as a means of resisting control attempts: Look for election systems where the chair's task in seeking control is itself computationally infeasible. We introduce and study a method of combining two or more candidate-anonymous election schemes in such a way that the combined scheme possesses all the resistances to control (i.e., all the NP-hardnesses of control) possessed by any of its constituents: It combines their strengths. From this and new resistance constructions, we prove for the first time that there exists an election scheme that is resistant to all twenty standard types of electoral control.
dc.identifierhttps://arxiv.org/abs/cs/0608057
dc.identifierhttp://arxiv.org/abs/cs/0608057
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/169990
dc.subjectComputer Science and Game Theory
dc.subjectComputational Complexity
dc.subjectMultiagent Systems
dc.subjectI.2.11; F.2.2; F.1.3
dc.titleHybrid Elections Broaden Complexity-Theoretic Resistance to Control
dc.typetext

Files

Collections

arXiv