Binary Aggregation by Selection of the Most Representative Voter
| Authors | |
|---|---|
| Publication date | 2014 |
| Book title | Proceedings of the twenty-eighth AAAI Conference on Artificial Intelligence and the twenty-sixth Innovative Applications of Artificial Intelligence Conference |
| Book subtitle | 27-31 July 2014, Québec City, Québec, Canada |
| ISBN |
|
| Event | 28th AAAI Conference on Artificial Intelligence |
| Volume | Issue number | 1 |
| Pages (from-to) | 668-674 |
| Publisher | Palo Alto, California: AAAI Press |
| Organisations |
|
| Abstract | 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. |
| Document type | Conference contribution |
| Language | English |
| Related publication | Binary Aggregation by Selection of the Most Representative Voter |
| Published at | http://www.aaai.org/ocs/index.php/AAAI/AAAI14/paper/view/8272 |
| Downloads |
8485
(Final published version)
|
| Permalink to this page | |
