On the Construction of High-Dimensional Simple Games

Martin Olsen, Sascha Kurz, Xavier Molinero

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Abstract

Voting is a commonly applied method for the aggregation of the preferences of multiple agents into a joint decision. If preferences are binary, i.e., "yes" and "no", every voting system can be described by a (monotone) Boolean function ?: {0, 1} n → {0,1}. However, its naive encoding needs 2n bits. The subclass of threshold functions, which is sufficient for homogeneous agents, allows a more succinct representation using n weights and one threshold. For heterogeneous agents, one can represent ? as an intersection of k threshold functions. Taylor and Zwicker have constructed a sequence of examples requiring k ≥ 2n/2-1 and provided a construction guaranteeing k ≤ ([nn/2]) ∈ 2 n-o(n). The magnitude of the worst-case situation was thought to be determined by Elkind et al. in 2008, but the analysis unfortunately turned out to be wrong. Here we uncover a relation to coding theory that allows the determination of the minimum number k for a subclass of voting systems. As an application, we give a construction for k > 2 n-o(n), i.e., there is no gain from a representation complexity point of view.

Original languageDanish
Title of host publicationFrontiers in Artificial Intelligence and Applications
Number of pages6
Volume285
PublisherIOS Press
Publication date2016
Pages880-885
ISBN (Print)978-1-61499-671-2
ISBN (Electronic)978-1-61499-672-9
DOIs
Publication statusPublished - 2016
SeriesFrontiers in Artificial Intelligence and Applications
ISSN0922-6389

Cite this