English
Related papers

Related papers: Participatory Budget Allocation Method for Approva…

200 papers

We investigate approval-based committee voting with incomplete information about the approval preferences of voters. We consider several models of incompleteness where each voter partitions the set of candidates into approved, disapproved,…

Computer Science and Game Theory · Computer Science 2024-08-21 Aviram Imber , Jonas Israel , Markus Brill , Benny Kimelfeld

We study the complexity of candidate control in participatory budgeting elections. The goal of constructive candidate control is to ensure that a given candidate wins by either adding or deleting candidates from the election (in the…

Computer Science and Game Theory · Computer Science 2026-01-26 Piotr Faliszewski , Łukasz Janeczko , Dušan Knop , Jan Pokorný , Šimon Schierreich , Mateusz Słuszniak , Krzysztof Sornat

Proportional ranking rules aggregate approval-style preferences of agents into a collective ranking such that groups of agents with similar preferences are adequately represented. Motivated by the application of live Q&A platforms, where…

Computer Science and Game Theory · Computer Science 2021-05-18 Jonas Israel , Markus Brill

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show…

Computer Science and Game Theory · Computer Science 2014-07-14 Haris Aziz , Serge Gaspers , Joachim Gudmundsson , Simon Mackenzie , Nicholas Mattei , Toby Walsh

We study a participatory budgeting problem, where a set of strategic agents wish to split a divisible budget among different projects, by aggregating their proposals on a single division. Unfortunately, the straight-forward rule that…

Computer Science and Game Theory · Computer Science 2022-03-21 Ioannis Caragiannis , George Christodoulou , Nicos Protopapas

Recent years have seen an increase in the use of online deliberation platforms (DPs). One of the main objectives of DPs is to enhance democratic participation, by allowing citizens to post, comment, and vote on policy proposals. But in what…

Computers and Society · Computer Science 2026-02-27 Nicolien Janssens , Frederik van de Putte

In mechanism design it is typical to impose incentive compatibility and then derive an optimal mechanism subject to this constraint. By replacing the incentive compatibility requirement with the goal of minimizing expected ex post regret,…

Computer Science and Game Theory · Computer Science 2012-08-07 Paul Duetting , Felix Fischer , Pitchayut Jirapinyo , John K. Lai , Benjamin Lubin , David C. Parkes

In this paper we extend the principle of proportional representation to rankings. We consider the setting where alternatives need to be ranked based on approval preferences. In this setting, proportional representation requires that…

Computer Science and Game Theory · Computer Science 2016-12-06 Piotr Skowron , Martin Lackner , Markus Brill , Dominik Peters , Edith Elkind

We present a new model of collective decision making that captures important crowd-funding and donor coordination scenarios. In the setting, there is a set of projects (each with its own cost) and a set of agents (that have their budgets as…

Computer Science and Game Theory · Computer Science 2021-01-29 Haris Aziz , Aditya Ganguly

In large scale collective decision making, social choice is a normative study of how one ought to design a protocol for reaching consensus. However, in instances where the underlying decision space is too large or complex for ordinal…

Computer Science and Game Theory · Computer Science 2017-10-03 Brandon Fain , Ashish Goel , Kamesh Munagala , Sukolsak Sakshuwong

We consider the algorithmic question of choosing a subset of candidates of a given size $k$ from a set of $m$ candidates, with knowledge of voters' ordinal rankings over all candidates. We consider the well-known and classic scoring rule…

Computer Science and Game Theory · Computer Science 2021-06-02 Kamesh Munagala , Zeyu Shen , Kangning Wang

We consider the notions of agreement, diversity, and polarization in ordinal elections (that is, in elections where voters rank the candidates). While (computational) social choice offers good measures of agreement between the voters, such…

Computer Science and Game Theory · Computer Science 2023-05-18 Piotr Faliszewski , Andrzej Kaczmarczyk , Krzysztof Sornat , Stanisław Szufa , Tomasz Wąs

Consider an election where N seats are distributed among parties with proportions p_1,...,p_m of the votes. We study, for the common divisor and quota methods, the asymptotic distribution, and in particular the mean, of the seat excess of a…

Probability · Mathematics 2011-10-31 Svante Janson

In rank aggregation, the task is to aggregate multiple weighted input rankings into a single output ranking. While numerous methods, so-called social welfare functions (SWFs), have been suggested for this problem, all of the classical SWFs…

Computer Science and Game Theory · Computer Science 2025-08-25 Patrick Lederer

We consider three algorithms for allocating parliamentary seats by proportional representation. The usual approach to describing such algorithms is to compute a quota of votes that each party uses to "acquire'' representatives. This kind of…

Data Structures and Algorithms · Computer Science 2023-11-07 Raul Rojas

Despite extensive theoretical research on proportionality in approval-based multiwinner voting, its impact on which committees and candidates can be selected in practice remains poorly understood. We address this gap by (i) analyzing the…

Computer Science and Game Theory · Computer Science 2025-11-13 Niclas Boehmer , Lara Glessen , Jannik Peters

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…

Computer Science and Game Theory · Computer Science 2025-10-14 Drew Springham , Edith Elkind , Bart de Keijzer , Maria Polukarov

Several rules for social choice are examined from a unifying point of view that looks at them as procedures for revising a system of degrees of belief in accordance with certain specified logical constraints. Belief is here a social…

Artificial Intelligence · Computer Science 2015-05-06 Rosa Camps , Xavier Mora , Laia Saumell

Peer reviews, evaluations, and selections are a fundamental aspect of modern science. Funding bodies the world over employ experts to review and select the best proposals from those submitted for funding. The problem of peer selection,…

Computer Science and Game Theory · Computer Science 2019-05-01 Haris Aziz , Omer Lev , Nicholas Mattei , Jeffrey S. Rosenschein , Toby Walsh

In this paper we analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them(e.g., transitivity when describing preferences).…

Computer Science and Game Theory · Computer Science 2013-06-20 Ilan Nehama
‹ Prev 1 3 4 5 6 7 10 Next ›