Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 1308-1313.
Abstract
Electoral 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 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.
@inproceedings{ijcai2007p211,
title = {Hybrid Elections Broaden Complexity-Theoretic Resistance to Control},
author = {Hemaspaandra, Edith and Hemaspaandra, Lane A. and Rothe, Jörg},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {1308--1313},
year = {2007},
url = {https://ijcai.org/proceedings/2007/211},
}
TY - CPAPER TI - Hybrid Elections Broaden Complexity-Theoretic Resistance to Control AU - Hemaspaandra, Edith AU - Hemaspaandra, Lane A. AU - Rothe, Jörg T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 1308 EP - 1313 UR - https://ijcai.org/proceedings/2007/211 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
