Current browse context:
cs.GT
Change to browse by:
References & Citations
Computer Science > Computer Science and Game Theory
Title: Selecting the Most Conflicting Pair of Candidates
(Submitted on 9 May 2024)
Abstract: 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.
Submission history
From: Andrzej Kaczmarczyk [view email][v1] Thu, 9 May 2024 16:00:20 GMT (12592kb,D)
Link back to: arXiv, form interface, contact.