We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

cs.GT

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Computer Science > Computer Science and Game Theory

Title: Selecting the Most Conflicting Pair of Candidates

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.
Comments: Accepted for publication at IJCAI-24; 27 pages; 11 figures
Subjects: Computer Science and Game Theory (cs.GT); Artificial Intelligence (cs.AI); Multiagent Systems (cs.MA)
Cite as: arXiv:2405.05870 [cs.GT]
  (or arXiv:2405.05870v1 [cs.GT] for this version)

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.