Bundling attacks in judgment aggregation

Noga Alon, Dvir Falik, Reshef Meir, Moshe Tennenholtz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations


We consider judgment aggregation over multiple independent issues, where the chairperson has her own opinion, and can try to bias the outcome by bundling several issues together. Since for each bundle judges must give a uniform answer on all issues, different partitions of the issues may result in an outcome that significantly differs from the "true", issue-wise, decision. We prove that the bundling problem faced by the chairperson, i.e. trying to bias the outcome towards her own opinion, is computationally difficult in the worst case. Then we study the probability that an effective bundling attack exists as the disparity between the opinions of the judges and the chair varies. We show that if every judge initially agrees with the chair on every issue with probability of at least 1/2, then there is almost always a bundling attack (i.e. a partition) where the opinion of the chair on all issues is approved. Moreover, such a partition can be found efficiently. In contrast, when the probability is lower than 1/2 then the chair cannot force her opinion using bundling even on a single issue

Original languageEnglish (US)
Title of host publicationProceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013
Number of pages7
StatePublished - 2013
Externally publishedYes
Event27th AAAI Conference on Artificial Intelligence, AAAI 2013 - Bellevue, WA, United States
Duration: Jul 14 2013Jul 18 2013

Publication series

NameProceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013


Other27th AAAI Conference on Artificial Intelligence, AAAI 2013
Country/TerritoryUnited States
CityBellevue, WA

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence


Dive into the research topics of 'Bundling attacks in judgment aggregation'. Together they form a unique fingerprint.

Cite this