On the robustness of preference aggregation in noisy environments

Ariel D. Procaccia, Jeffrey S. Rosenschein, Gal A. Kaminka

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

8 Scopus citations

Abstract

In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theoretical model of noisy preference aggregation and formally defining the (worst-case) robustness of a voting rule. We use our model to analytically bound the robustness of various prominent rules. The results show that the robustness of voting rules is diverse, with different rules positioned at either end of the spectrum. These results allow selection of voting rules that support preference aggregation in the face of noise.

Original languageEnglish
Title of host publicationAAMAS'07 - Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems
Pages428-434
Number of pages7
DOIs
StatePublished - 2007
Event6th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS'07 - Honolulu, HI, United States
Duration: 14 May 200818 May 2008

Publication series

NameProceedings of the International Conference on Autonomous Agents

Conference

Conference6th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS'07
Country/TerritoryUnited States
CityHonolulu, HI
Period14/05/0818/05/08

Keywords

  • Computational complexity
  • Voting

Fingerprint

Dive into the research topics of 'On the robustness of preference aggregation in noisy environments'. Together they form a unique fingerprint.

Cite this