Selecting the Most Conflicting Pair of Candidates

Théo Delemazure, Łukasz Janeczko, Andrzej Kaczmarczyk, Stanisław Szufa
5/9/2024
cs.GTcs.AIcs.MA

No official code found. Best implementation: Project-PRAGMA/conflictual-rules--IJCAI-24 (0 stars, MIT, last commit 2024-05-23).

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.

View on arXivView PDF

Code Implementations(1)

MIT

Companion code to paper "Selecting the Most Conflicting Pair of Candidates" by Delemazure, Janeczko, Kaczmarczyk, and Szufa

01Python, Jupyter NotebookMay 9, 20242 years agoMIT

Similar Papers

Cite this paper

@article{delemazure2024selecting,
  title  = {Selecting the Most Conflicting Pair of Candidates},
  author = {Théo Delemazure and Łukasz Janeczko and Andrzej Kaczmarczyk and Stanisław Szufa},
  year   = {2024},
  eprint = {2405.05870},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.05870v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.05870.svg)](https://codeofpaper.com/paper/2405.05870)

Discussion