Binary Aggregation by Selection of the Most Representative Voters
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.
Cite
Text
Endriss and Grandi. "Binary Aggregation by Selection of the Most Representative Voters." AAAI Conference on Artificial Intelligence, 2014. doi:10.1609/AAAI.V28I1.8798Markdown
[Endriss and Grandi. "Binary Aggregation by Selection of the Most Representative Voters." AAAI Conference on Artificial Intelligence, 2014.](https://mlanthology.org/aaai/2014/endriss2014aaai-binary/) doi:10.1609/AAAI.V28I1.8798BibTeX
@inproceedings{endriss2014aaai-binary,
title = {{Binary Aggregation by Selection of the Most Representative Voters}},
author = {Endriss, Ulle and Grandi, Umberto},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2014},
pages = {668-674},
doi = {10.1609/AAAI.V28I1.8798},
url = {https://mlanthology.org/aaai/2014/endriss2014aaai-binary/}
}