English
Related papers

Related papers: Low Sample Complexity Participatory Budgeting

200 papers

Consider the following social choice problem. Suppose we have a set of $n$ voters and $m$ candidates that lie in a metric space. The goal is to design a mechanism to choose a candidate whose average distance to the voters is as small as…

Computer Science and Game Theory · Computer Science 2021-11-09 Moses Charikar , Prasanna Ramakrishnan

We study metric distortion in distributed voting, where $n$ voters are partitioned into $k$ groups, each selecting a local representative, and a final winner is chosen from these representatives (or from the entire set of candidates). This…

Computer Science and Game Theory · Computer Science 2025-11-25 Mohammad Ali Abam , Davoud Kareshki , Marzieh Nilipour , Mohammad Hossein Paydar , Masoud Seddighin

In distortion-based analysis of social choice rules over metric spaces, one assumes that all voters and candidates are jointly embedded in a common metric space. Voters rank candidates by non-decreasing distance. The mechanism, receiving…

Computer Science and Game Theory · Computer Science 2019-11-21 David Kempe

We study the design of voting rules in the metric distortion framework. It is known that any deterministic rule suffers distortion of at least $3$, and that randomized rules can achieve distortion strictly less than $3$, often at the cost…

Computer Science and Game Theory · Computer Science 2026-02-10 Ziyi Cai , D. D. Gao , Prasanna Ramakrishnan , Kangning Wang

We consider the following well-studied problem of metric distortion in social choice. Suppose we have an election with $n$ voters and $m$ candidates located in a shared metric space. We would like to design a voting rule that chooses a…

Computer Science and Game Theory · Computer Science 2024-11-07 Moses Charikar , Prasanna Ramakrishnan , Kangning Wang , Hongxun Wu

Metric distortion in social choice is a framework for evaluating how well voting rules minimize social cost when both voters and candidates exist in a shared metric space, with a voter's cost defined by their distance to a candidate. Voters…

Computer Science and Game Theory · Computer Science 2025-02-14 Mohak Goyal , Sahasrajit Sarmasarkar

In this work we study the metric distortion problem in voting theory under a limited amount of ordinal information. Our primary contribution is threefold. First, we consider mechanisms which perform a sequence of pairwise comparisons…

Computer Science and Game Theory · Computer Science 2021-07-07 Ioannis Anagnostides , Dimitris Fotakis , Panagiotis Patsilinakos

In this paper, we study the distortion bounds for voting mechanisms in multi-winner elections in general metric spaces. Our study pertains to the case in which each voter only reports her favorite candidate amongst $m$ possible choices.…

Computer Science and Game Theory · Computer Science 2025-05-29 Gennaro Auricchio , Zeyu Ren , Zihe Wang , Jie Zhang

We study higher statistical moments of Distortion for randomized social choice in a metric implicit utilitarian model. The Distortion of a social choice mechanism is the expected approximation factor with respect to the optimal utilitarian…

Computer Science and Game Theory · Computer Science 2020-04-29 Brandon Fain , William Fan , Kamesh Munagala

We study social choice mechanisms in an implicit utilitarian framework with a metric constraint, where the goal is to minimize \textit{Distortion}, the worst case social cost of an ordinal mechanism relative to underlying cardinal…

Computer Science and Game Theory · Computer Science 2020-07-03 Brandon Fain , Ashish Goel , Kamesh Munagala , Nina Prabhu

We study deliberative social choice, where voters engage in small-group discussions to output collective preferences that are then aggregated by a social choice rule. We introduce a simple deliberation-via-matching protocol. In this…

Computer Science and Game Theory · Computer Science 2026-04-27 Kamesh Munagala , Qilin Ye , Ian Zhang

We study a generalization of the standard approval-based model of participatory budgeting (PB), in which voters are providing approval ballots over a set of predefined projects and -- in addition to a global budget limit, there are several…

Computer Science and Game Theory · Computer Science 2020-12-10 Pallavi Jain , Krzysztof Sornat , Nimrod Talmon , Meirav Zehavi

Participatory budgeting (PB) is a democratic process where citizens jointly decide on how to allocate public funds to indivisible projects. This paper focuses on PB processes where citizens may give additional money to projects they want to…

Multiagent Systems · Computer Science 2021-05-03 Jiehua Chen , Martin Lackner , Jan Maly

We study social choice rules under the utilitarian distortion framework, with an additional metric assumption on the agents' costs over the alternatives. In this approach, these costs are given by an underlying metric on the set of all…

Computer Science and Game Theory · Computer Science 2021-01-15 Ashish Goel , Anilesh Kollagunta Krishnaswamy , Kamesh Munagala

We consider models for social choice where voters rank a set of choices (or alternatives) by deliberating in small groups of size at most $k$, and these outcomes are aggregated by a social choice rule to find the winning alternative. We…

Computer Science and Game Theory · Computer Science 2025-03-21 Ashish Goel , Mohak Goyal , Kamesh Munagala

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…

Computer Science and Game Theory · Computer Science 2020-12-11 Haris Aziz , Barton E. Lee

Participatory budgeting (PB) is a democratic process for allocating funds to projects based on the votes of community members. PB outcomes are commonly evaluated for how they reflect voters preferences (e.g., social welfare) and the extent…

Computer Science and Game Theory · Computer Science 2024-12-03 Roy Fairstein , Reshef Meir , Kobi Gal

Participatory budgeting (PB) has been widely adopted and has attracted significant research efforts; however, there is a lack of mechanisms for PB which elicit project interactions, such as substitution and complementarity, from voters.…

Computer Science and Game Theory · Computer Science 2023-07-17 Mohak Goyal , Sahasrajit Sarmasarkar , Ashish Goel

We consider the distributed single-winner metric voting problem on a line, where agents and alternative are represented by points on the line of real numbers, the agents are partitioned into disjoint districts, and the goal is to choose a…

Computer Science and Game Theory · Computer Science 2023-01-05 Alexandros A. Voudouris

In Spatial Voting Theory, distortion is a measure of how good the winner is. It is proved that no deterministic voting mechanism can guarantee a distortion better than $3$, even for simple metrics such as a line. In this study, we wish to…

Computer Science and Game Theory · Computer Science 2020-08-04 Mohammad Ghodsi , Mohamad Latifian , Masoud Seddighin
‹ Prev 1 2 3 10 Next ›