Approval-Based Multiwinner Voting with Candidate Qualities

📅 2026-09-08
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
研究引入候选者质量分数的新多胜者投票模型,提出基于阈值和价值的公理族,分析其关系及计算复杂性,并探索与最大化总质量目标的兼容性。
📝 Abstract
We initiate the study of a new model of approval-based multiwinner voting in which each candidate carries an exogenous quality score, capturing, for instance, the reliability of the candidate or their relevance to the context of the selection. Quality scores break with the standard assumption of approval-based multiwinner voting that candidates are fully defined by the set of their supporters. We rethink what proportional representation means in the presence of quality scores. For this, we introduce a threshold-based and a value-based family of axioms, analyze their relationships, satisfiability, and computational complexity, and present rules that achieve the strongest jointly satisfiable combinations of our proportionality axioms. We then analyze the compatibility of proportionality with the natural goal of maximizing the summed quality of the selected candidates. While imposing standard proportionality notions can lead to an almost complete loss of quality, we show that under a new class of reciprocal axioms, which scale a group's entitlement by the quality of its commonly approved candidate(s), there always exist proportional committees retaining at least 3/4 of the optimal summed quality, and such committees can be computed by our voting rules at no additional computational cost.
Problem

Research questions and friction points this paper is trying to address.

Approval-Based Multiwinner Voting
Candidate Qualities
Proportional Representation
Quality Scores
Innovation

Methods, ideas, or system contributions that make the work stand out.

quality scores
proportional representation
approval-based multiwinner voting
reciprocal axioms
🔎 Similar Papers
2018-03-15arXiv.orgCitations: 29
💼 Related Jobs
No related jobs found.
Niclas Boehmer
Niclas Boehmer
Hasso Plattner Institute
Computational Social ChoiceAI for Social GoodAlgorithmic Game TheoryParameterized Complexity
C
Chris Dong
Hasso Plattner Institute, University of Potsdam, Germany
L
Luca Kreisel
Hasso Plattner Institute, University of Potsdam, Germany
M
Markus Utke
Eindhoven University of Technology, Netherlands