English
Related papers

Related papers: Low Sample Complexity Participatory Budgeting

200 papers

In an indivisible participatory budgeting (PB) framework, we have a limited budget that is to be distributed among a set of projects, by aggregating the preferences of voters for the projects. All the prior work on indivisible PB assumes…

Computer Science and Game Theory · Computer Science 2023-05-19 Gogulapati Sreedurga

We consider a setting with agents that have preferences over alternatives and are partitioned into disjoint districts. The goal is to choose one alternative as the winner using a mechanism which first decides a representative alternative…

Computer Science and Game Theory · Computer Science 2023-01-10 Aris Filos-Ratsikas , Alexandros A. Voudouris

Distortion-based analysis has established itself as a fruitful framework for comparing voting mechanisms. m voters and n candidates are jointly embedded in an (unknown) metric space, and the voters submit rankings of candidates by…

Computer Science and Game Theory · Computer Science 2019-12-17 David Kempe

In the single winner determination problem, we have n voters and m candidates and each voter j incurs a cost c(i, j) if candidate i is chosen. Our objective is to choose a candidate that minimizes the expected total cost incurred by the…

Computer Science and Game Theory · Computer Science 2021-11-18 Haripriya Pulyassary , Chaitanya Swamy

In this paper, we study the metric distortion of deterministic social choice rules that choose a winning candidate from a set of candidates based on voter preferences. Voters and candidates are located in an underlying metric space. A voter…

Computer Science and Game Theory · Computer Science 2019-05-07 Kamesh Munagala , Kangning Wang

Participatory Budgeting (PB) is a process in which voters decide how to allocate a common budget; most commonly it is done by ordinary people -- in particular, residents of some municipality -- to decide on a fraction of the municipal…

Multiagent Systems · Computer Science 2021-11-16 Ariel Rosenfeld , Nimrod Talmon

We study the robustness of approval-based participatory budgeting (PB) rules to random noise in the votes. Our contributions are twofold. First, we study the computational complexity of the #Flip-Bribery problem, where given a PB instance…

Computer Science and Game Theory · Computer Science 2023-05-16 Niclas Boehmer , Piotr Faliszewski , Łukasz Janeczko , Andrzej Kaczmarczyk

The metric distortion framework posits that n voters and m candidates are jointly embedded in a metric space such that voters rank candidates that are closer to them higher. A voting rule's purpose is to pick a candidate with minimum total…

Computer Science and Game Theory · Computer Science 2023-07-03 Fatih Erdem Kizilkaya , David Kempe

In the well-studied metric distortion problem in social choice, we have voters and candidates located in a shared metric space, and the objective is to design a voting rule that selects a candidate with minimal total distance to the voters.…

Computer Science and Game Theory · Computer Science 2025-05-21 Moses Charikar , Prasanna Ramakrishnan , Zihan Tan , Kangning Wang

Participatory Budgeting (PB) is commonly studied from an axiomatic perspective, where the aim is to design procedurally fair and economically efficient rules for voters with full information regarding their preferences. In contrast, we take…

Computer Science and Game Theory · Computer Science 2026-01-28 Qishen Han , Artem Ivaniuk , Edith Elkind , Lirong Xia

We study strategic behavior of project proposers in the context of approval-based participatory budgeting (PB). In our model we assume that the votes are fixed and known and the proposers want to set as high project prices as possible,…

Computer Science and Game Theory · Computer Science 2024-07-30 Piotr Faliszewski , Łukasz Janeczko , Andrzej Kaczmarczyk , Grzegorz Lisowski , Piotr Skowron , Stanisław Szufa

In participatory budgeting we are given a set of projects---each with a cost, an available budget, and a set of voters who in some form express their preferences over the projects. The goal is to select---based on voter preferences---a…

Multiagent Systems · Computer Science 2020-09-08 Piotr Skowron , Arkadii Slinko , Stanisław Szufa , Nimrod Talmon

In the metric distortion problem, a set of voters and candidates lie in a common metric space, and a committee of $k$ candidates must be elected. The objective is to minimize a social cost, defined as a function of the distances between…

Computer Science and Game Theory · Computer Science 2025-10-16 Javier Cembrano , Golnoosh Shahkarami

Participatory budgeting engages the public in the process of allocating public money to different types of projects. PB designs differ in how voters are asked to express their preferences over candidate projects and how these preferences…

Computer Science and Game Theory · Computer Science 2023-02-28 Roy Fairstein , Gerdus Benadè , Kobi Gal

In this survey, we review the literature investigating participatory budgeting as a social choice problem. Participatory Budgeting (PB) is a democratic process in which citizens are asked to vote on how to allocate a given amount of public…

Computer Science and Game Theory · Computer Science 2025-03-14 Simon Rey , Felicia Schmidt , Jan Maly

We study the problem of minimizing metric distortion in multi-winner elections, where a committee of size $k$ is selected from a set of candidates based on voters' ordinal preferences. We assume that voters and candidates are embedded on a…

Computer Science and Game Theory · Computer Science 2026-02-18 Negar Babashah , Hasti Karimi , Masoud Seddighin , Golnoosh Shahkarami

A key promise of democratic voting is that, by accounting for all constituents' preferences, it produces decisions that benefit the constituency overall. It is alarming, then, that all deterministic voting rules have unbounded distortion:…

Computer Science and Game Theory · Computer Science 2023-05-22 Bailey Flanigan , Ariel D. Procaccia , Sven Wang

Participatory Budgeting (PB) is a popular voting method by which a limited budget is divided among a set of projects, based on the preferences of voters over the projects. PB is broadly categorised as divisible PB (if the projects are…

Computer Science and Game Theory · Computer Science 2022-05-02 Gogulapati Sreedurga , Mayank Ratan Bhardwaj , Y. Narahari

In a setting where $m$ items need to be partitioned among $n$ agents, we evaluate the performance of mechanisms that take as input each agent's \emph{ordinal preferences}, i.e., their ranking of the items from most- to least-preferred. The…

Computer Science and Game Theory · Computer Science 2026-02-13 Ioannis Caragiannis , Vasilis Gkatzelis , Sebastian Homrighausen

We consider a distributed voting problem with a set of agents that are partitioned into disjoint groups and a set of obnoxious alternatives. Agents and alternatives are represented by points in a metric space. The goal is to compute the…

Computer Science and Game Theory · Computer Science 2024-12-17 Alexandros A. Voudouris