Position-Based Social Choice Methods for Intransitive Incomplete Pairwise Vote Sets (Student Abstract)
Abstract
Combining the decisions of multiple agents into a final decision requires the use of social choice mechanisms. Pairwise decisions are often incomplete and intransitive, preventing the use of Borda count and other position-based social choice mechanisms. We propose and compare multiple methods for converting incomplete intransitive pairwise vote sets to complete rankings, enabling position-based social choice methods. The algorithms are evaluated on their output's Kendall's τ similarity when implementing pairwise social choice mechanisms. We show that there is only a small difference between the outputs of social choice methods on the original pairwise vote set and the generated ranking set on a real-world pairwise voting dataset. Source code for the analysis is available.1
Cite
Text
Zucker. "Position-Based Social Choice Methods for Intransitive Incomplete Pairwise Vote Sets (Student Abstract)." AAAI Conference on Artificial Intelligence, 2020. doi:10.1609/AAAI.V34I10.7273Markdown
[Zucker. "Position-Based Social Choice Methods for Intransitive Incomplete Pairwise Vote Sets (Student Abstract)." AAAI Conference on Artificial Intelligence, 2020.](https://mlanthology.org/aaai/2020/zucker2020aaai-position/) doi:10.1609/AAAI.V34I10.7273BibTeX
@inproceedings{zucker2020aaai-position,
title = {{Position-Based Social Choice Methods for Intransitive Incomplete Pairwise Vote Sets (Student Abstract)}},
author = {Zucker, Julian},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2020},
pages = {14001-14002},
doi = {10.1609/AAAI.V34I10.7273},
url = {https://mlanthology.org/aaai/2020/zucker2020aaai-position/}
}