Junta distributions and the average-case complexity of manipulating elections

Ariel D. Procaccia*, Jeffrey S. Rosenschein

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations

Abstract

Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manipulate, but predictably used NP-hardness as the complexity measure. Such a worst-case analysis may be an insufficient guarantee of resistance to manipulation. Indeed, we demonstrate that NP-hard manipulations may be tractable in the average-case. For this purpose, we augment the existing theory of average-case complexity with new concepts; we consider elections distributed with respect to junta distributions, which concentrate on hard instances, and introduce a notion of heuristic polynomial time. We use our techniques to prove that a family of important voting protocols is susceptible to manipulation by coalitions, when the number of candidates is constant.

Original languageAmerican English
Title of host publicationProceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems
Pages497-504
Number of pages8
DOIs
StatePublished - 2006
EventFifth International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS - Hakodate, Japan
Duration: 8 May 200612 May 2006

Publication series

NameProceedings of the International Conference on Autonomous Agents
Volume2006

Conference

ConferenceFifth International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Country/TerritoryJapan
CityHakodate
Period8/05/0612/05/06

Keywords

  • Computational complexity
  • Voting

Fingerprint

Dive into the research topics of 'Junta distributions and the average-case complexity of manipulating elections'. Together they form a unique fingerprint.

Cite this