Maximizing Index Diversity in Committee Elections

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Böhm, Paula, Bredereck, Robert, Fluschnik, Till
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866912899158507520
author Böhm, Paula
Bredereck, Robert
Fluschnik, Till
author_facet Böhm, Paula
Bredereck, Robert
Fluschnik, Till
contents We introduce two models of multiwinner elections with approval preferences and labelled candidates that take the committee's diversity into account. One model aims to find a committee with maximal diversity given a scoring function (e.g. of a scoring-based voting rule) and a lower bound for the score to be respected. The second model seeks to maximize the diversity given a minimal satisfaction for each agent to be respected. To measure the diversity of a committee, we use multiple diversity indices used in ecology and introduce one new index. We define (desirable) properties of diversity indices, test the indices considered against these properties, and characterize the new index. We analyze the computational complexity of computing a committee for both models and scoring functions of well-known voting rules, and investigate the influence of weakening the score or satisfaction constraints on the diversity empirically.
format Preprint
id arxiv_https___arxiv_org_abs_2602_11400
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Maximizing Index Diversity in Committee Elections
Böhm, Paula
Bredereck, Robert
Fluschnik, Till
Computer Science and Game Theory
91B12, 91B14
G.2.1; G.2.3; F.2.2
We introduce two models of multiwinner elections with approval preferences and labelled candidates that take the committee's diversity into account. One model aims to find a committee with maximal diversity given a scoring function (e.g. of a scoring-based voting rule) and a lower bound for the score to be respected. The second model seeks to maximize the diversity given a minimal satisfaction for each agent to be respected. To measure the diversity of a committee, we use multiple diversity indices used in ecology and introduce one new index. We define (desirable) properties of diversity indices, test the indices considered against these properties, and characterize the new index. We analyze the computational complexity of computing a committee for both models and scoring functions of well-known voting rules, and investigate the influence of weakening the score or satisfaction constraints on the diversity empirically.
title Maximizing Index Diversity in Committee Elections
topic Computer Science and Game Theory
91B12, 91B14
G.2.1; G.2.3; F.2.2
url https://arxiv.org/abs/2602.11400