- Binary Aggregation by Selection of the Most Representative Voter
- 28th AAAI Conference on Artificial Intelligence
- Book/source title
- Proceedings of the twenty-eighth AAAI Conference on Artificial Intelligence and the twenty-sixth Innovative Applications of Artificial Intelligence Conference
- Book/source subtitle
- 27-31 July 2014, Québec City, Québec, Canada
- Pages (from-to)
- Palo Alto, California: AAAI Press
- Volume (Publisher)
- Document type
- Conference contribution
- Interfacultary Research Institutes
- Institute for Logic, Language and Computation (ILLC)
In binary aggregation, each member of a group expresses yes/no choices regarding several correlated issues and we need to decide on a collective choice that accurately reflects the views of the group. A good collective choice will minimise the distance to each of the individual choices, but using such a distance-based aggregation rule is computationally intractable. Instead, we explore a class of low-complexity aggregation rules that select the most representative voter in any given situation and return that voter's choice as the outcome.
- Final publisher version
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.