Selecting the Most Conflicting Pair of Candidates
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911871599116288 |
|---|---|
| author | Delemazure, Théo Janeczko, Łukasz Kaczmarczyk, Andrzej Szufa, Stanisław |
| author_facet | Delemazure, Théo Janeczko, Łukasz Kaczmarczyk, Andrzej Szufa, Stanisław |
| contents | We study committee elections from a perspective of finding the most conflicting candidates, that is, candidates that imply the largest amount of conflict, as per voter preferences. By proposing basic axioms to capture this objective, we show that none of the prominent multiwinner voting rules meet them. Consequently, we design committee voting rules compliant with our desiderata, introducing conflictual voting rules. A subsequent deepened analysis sheds more light on how they operate. Our investigation identifies various aspects of conflict, for which we come up with relevant axioms and quantitative measures, which may be of independent interest. We support our theoretical study with experiments on both real-life and synthetic data. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_05870 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Selecting the Most Conflicting Pair of Candidates Delemazure, Théo Janeczko, Łukasz Kaczmarczyk, Andrzej Szufa, Stanisław Computer Science and Game Theory Artificial Intelligence Multiagent Systems We study committee elections from a perspective of finding the most conflicting candidates, that is, candidates that imply the largest amount of conflict, as per voter preferences. By proposing basic axioms to capture this objective, we show that none of the prominent multiwinner voting rules meet them. Consequently, we design committee voting rules compliant with our desiderata, introducing conflictual voting rules. A subsequent deepened analysis sheds more light on how they operate. Our investigation identifies various aspects of conflict, for which we come up with relevant axioms and quantitative measures, which may be of independent interest. We support our theoretical study with experiments on both real-life and synthetic data. |
| title | Selecting the Most Conflicting Pair of Candidates |
| topic | Computer Science and Game Theory Artificial Intelligence Multiagent Systems |
| url | https://arxiv.org/abs/2405.05870 |