中文
相关论文

相关论文: Likelihood of the Existence of Average Justified R…

200 篇论文

We consider approval-based committee voting, i.e. the setting where each voter approves a subset of candidates, and these votes are then used to select a fixed-size set of winners (committee). We propose a natural axiom for this setting,…

多智能体系统 · 计算机科学 2016-09-13 Haris Aziz , Markus Brill , Vincent Conitzer , Edith Elkind , Rupert Freeman , Toby Walsh

The goal of multi-winner elections is to choose a fixed-size committee based on voters' preferences. An important concern in this setting is representation: large groups of voters with cohesive preferences should be adequately represented…

计算机科学与博弈论 · 计算机科学 2025-12-10 Luis Sánchez-Fernández , Edith Elkind , Martin Lackner , Norberto Fernández , Jesús A. Fisteus , Pablo Basanta Val , Piotr Skowron

In multiwinner approval voting, the goal is to select $k$-member committees based on voters' approval ballots. A well-studied concept of proportionality in this context is the justified representation (JR) axiom, which demands that no large…

计算机科学与博弈论 · 计算机科学 2024-09-10 Edith Elkind , Piotr Faliszewski , Ayumi Igarashi , Pasin Manurangsi , Ulrike Schmidt-Kraepelin , Warut Suksompong

Justified Representation (JR)/Extended Justified Representation (EJR) is a desirable axiom in multiwinner approval voting. In contrast to that (E)JR only requires at least \emph{one} voter to be represented in every cohesive group, we study…

计算机科学与博弈论 · 计算机科学 2025-02-19 Biaoshuai Tao , Chengkai Zhang , Houyu Zhou

Justified representation (JR) is a standard notion of representation in multiwinner approval voting. Not only does a JR committee always exist, but previous work has also shown through experiments that the JR condition can typically be…

计算机科学与博弈论 · 计算机科学 2023-06-29 Edith Elkind , Piotr Faliszewski , Ayumi Igarashi , Pasin Manurangsi , Ulrike Schmidt-Kraepelin , Warut Suksompong

In multiwinner approval voting, forming a committee that proportionally represents voters' approval ballots is an essential task. The notion of justified representation (JR) demands that any large "cohesive" group of voters should be…

计算机科学与博弈论 · 计算机科学 2025-01-22 Yusuf Hakan Kalayci , Jiasen Liu , David Kempe

We consider a committee voting setting in which each voter approves of a subset of candidates and based on the approvals, a target number of candidates are to be selected. In particular we focus on the axiomatic property called extended…

计算机科学与博弈论 · 计算机科学 2017-03-31 Haris Aziz , Shenwei Huang

In this short note, we describe an approval-based committee selection rule that admits a polynomial-time algorithm and satisfies the Extended Justified Representation (EJR) axiom. This rule is based on approximately maximizing the PAV…

计算机科学与博弈论 · 计算机科学 2017-04-04 Piotr Skowron , Martin Lackner , Edith Elkind , Luis Sánchez-Fernández

In multiwinner approval elections with many candidates, voters may struggle to determine their preferences over the entire slate of candidates. It is therefore of interest to explore which (if any) fairness guarantees can be provided under…

计算机科学与博弈论 · 计算机科学 2025-10-14 Drew Springham , Edith Elkind , Bart de Keijzer , Maria Polukarov

Justified representation (JR) and extended justified representation (EJR) are well-established proportionality axioms in approval-based multiwinner voting. Both axioms are always satisfiable, but they rely on a fixed quota (typically Hare…

计算机科学与博弈论 · 计算机科学 2026-02-18 Patrick Becker , Fabian Frank

The study of proportionality in multiwinner voting with approval ballots has received much attention in recent years. Typically, proportionality is captured by variants of the Justified Representation axiom, which say that cohesive groups…

计算机科学与博弈论 · 计算机科学 2025-08-04 Matthew M. Casey , Edith Elkind

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

When selecting a subset of candidates (a so-called committee) based on the preferences of voters, proportional representation is often a major desideratum. When going beyond simplistic models such as party-list or district-based elections,…

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

An important desideratum in approval-based multiwinner voting is proportionality. We study the problem of reconfiguring proportional committees: given two proportional committees, is there a transition path that consists only of…

计算机科学与博弈论 · 计算机科学 2025-04-22 Chris Dong , Fabian Frank , Jannik Peters , Warut Suksompong

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

We study voting rules for participatory budgeting, where a group of voters collectively decides which projects should be funded using a common budget. We allow the projects to have arbitrary costs, and the voters to have arbitrary additive…

计算机科学与博弈论 · 计算机科学 2022-10-18 Dominik Peters , Grzegorz Pierczyński , Piotr Skowron

The property of proportional representation in approval-based committee elections has appeared in the social choice literature for over a century, and is typically understood as avoiding the underrepresentation of minorities. However, we…

数据结构与算法 · 计算机科学 2021-09-14 Alfonso Cevallos , Alistair Stewart

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

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

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
‹ 上一页 1 2 3 10 下一页 ›