中文
相关论文

相关论文: Optimal Average Satisfaction and Extended Justifie…

200 篇论文

We consider a voting scenario in which the resource to be voted upon may consist of both indivisible and divisible goods. This setting generalizes both the well-studied model of multiwinner voting and the recently introduced model of cake…

计算机科学与博弈论 · 计算机科学 2024-10-14 Xinhang Lu , Jannik Peters , Haris Aziz , Xiaohui Bei , Warut Suksompong

Even though proportional representation is a fundamental goal in multiwinner voting and a plethora of proportionality notions has been introduced, the normative justifications for choosing one notion over another remain poorly understood.…

计算机科学与博弈论 · 计算机科学 2026-05-07 Chris Dong , Jannik Peters

Social choice is replete with various settings including single-winner voting, multi-winner voting, probabilistic voting, multiple referenda, and public decision making. We study a general model of social choice called Sub-Committee Voting…

计算机科学与博弈论 · 计算机科学 2017-11-17 Haris Aziz , Barton E. Lee

Participatory budgeting (PB) is a democratic paradigm whereby voters decide on a set of projects to fund with a limited budget. We consider PB in a setting where voters report ordinal preferences over projects and have (possibly) asymmetric…

计算机科学与博弈论 · 计算机科学 2020-12-11 Haris Aziz , Barton E. Lee

When selecting committees based on preferences of voters, a variety of different criteria can be considered. Two natural objectives are maximizing the utilitarian welfare (the sum of voters' utilities) and coverage (the number of…

计算机科学与博弈论 · 计算机科学 2023-12-14 Markus Brill , Jannik Peters

We study proportional representation in the temporal voting model, where collective decisions are made repeatedly over time over a fixed horizon. Prior work has extensively investigated how proportional representation axioms from…

计算机科学与博弈论 · 计算机科学 2026-05-13 Nicholas Teh

Given a set of agents with approval preferences over each other, we study the task of finding $k$ matchings fairly representing everyone's preferences. We model the problem as an approval-based multiwinner election where the set of…

计算机科学与博弈论 · 计算机科学 2021-02-16 Niclas Boehmer , Markus Brill , Ulrike Schmidt-Kraepelin

We present a polynomial-time algorithm for computing an optimal committee of size $k$ under any given Thiele voting rule for elections on the Voter Interval domain (i.e., when voters can be ordered so that each candidate is approved by a…

计算机科学与博弈论 · 计算机科学 2026-04-08 Pasin Manurangsi , Krzysztof Sornat

The ability to measure the satisfaction of (groups of) voters is a crucial prerequisite for formulating proportionality axioms in approval-based participatory budgeting elections. Two common - but very different - ways to measure the…

计算机科学与博弈论 · 计算机科学 2023-10-19 Markus Brill , Stefan Forster , Martin Lackner , Jan Maly , Jannik Peters

In approval-based multiwinner voting, voters express approval preferences over a set of candidates, and the goal is to return a winning committee. This model captures a broad range of subset selection problems under preferences. Prior work…

计算机科学与博弈论 · 计算机科学 2026-04-28 Niclas Boehmer , Luca Kreisel , Jannik Peters

Selecting $k$ out of $m$ items based on the preferences of $n$ heterogeneous agents is a widely studied problem in algorithmic game theory. If agents have approval preferences over individual items and harmonic utility functions over…

计算机科学与博弈论 · 计算机科学 2024-08-06 Sonja Kraiczy , Edith Elkind

Consider a committee election consisting of (i) a set of candidates who are divided into arbitrary groups each of size ${at~most}$ two and a diversity constraint that stipulates the selection of ${at~least}$ one candidate from each group…

计算复杂性 · 计算机科学 2025-10-22 Kunal Relia

In the apportionment problem, a fixed number of seats must be distributed among parties in proportion to the number of voters supporting each party. We study a generalization of this setting, in which voters can support multiple parties by…

计算机科学与博弈论 · 计算机科学 2022-03-31 Markus Brill , Paul Gölz , Dominik Peters , Ulrike Schmidt-Kraepelin , Kai Wilker

The winner determination problems of many attractive multi-winner voting rules are NP-complete. However, they often admit polynomial-time algorithms when restricting inputs to be single-peaked. Commonly, such algorithms employ dynamic…

计算机科学与博弈论 · 计算机科学 2021-04-20 Dominik Peters

When selecting multiple candidates based on approval preferences of agents, the proportional representation of agents' opinions is an important and well-studied desideratum. Existing criteria for evaluating the representativeness of…

计算机科学与博弈论 · 计算机科学 2024-10-02 Markus Brill , Jonas Israel , Evi Micha , Jannik Peters

We introduces a general linear framework that unifies the study of multi-winner voting rules and proportionality axioms, demonstrating that many prominent multi-winner voting rules-including Thiele methods, their sequential variants, and…

计算机科学与博弈论 · 计算机科学 2025-03-06 Lirong Xia

We study multiwinner elections with approval-based preferences. An instance of a multiwinner election consists of a set of alternatives, a population of voters---each voter approves a subset of alternatives, and the desired committee size…

计算机科学与博弈论 · 计算机科学 2019-10-15 Piotr Skowron

We consider a voting model, where a number of candidates need to be selected subject to certain feasibility constraints. The model generalises committee elections (where there is a single constraint on the number of candidates that need to…

计算机科学与博弈论 · 计算机科学 2025-09-24 Tomáš Masařík , Grzegorz Pierczyński , Piotr Skowron

We study diversity in approval-based committee elections with incomplete or inaccurate information. We define diversity according to the Maximum Coverage problem, which is known to be $\mathsf{NP}$-complete, with a best attainable…

计算机科学与博弈论 · 计算机科学 2026-05-07 Feline Lindeboom , Martijn Brehm , Davide Grossi , Pradeep Murukannaiah

The best-of-both-worlds paradigm advocates an approach that achieves desirable properties both ex-ante and ex-post. We launch a best-of-both-worlds fairness perspective for the important social choice setting of approval-based committee…

计算机科学与博弈论 · 计算机科学 2023-12-27 Haris Aziz , Xinhang Lu , Mashbat Suzuki , Jeremy Vollen , Toby Walsh