Pith. sign in

REVIEW 9 cited by

The (Computational) Social Choice Take on Indivisible Participatory Budgeting

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2303.00621 v9 pith:RRRQOCZP submitted 2023-03-01 cs.GT cs.MA

classification cs.GTcs.MA
keywords literaturebudgetingchoiceparticipatoryproblemprojectsresearchsocial
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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 money to a set of projects. From a social choice perspective, it corresponds then to the problem of aggregating opinions about which projects should be funded, into a budget allocation satisfying a budget constraint. This problem has received substantial attention in recent years and the literature is growing at a fast pace. In this survey, we present the most important research directions from the literature, each time presenting a large set of representative results. We only focus on the indivisible case, that is, PB problems in which projects can either be fully funded or not at all. The aim of the survey is to present a comprehensive overview of the state of the research on PB. We aim at providing both a general overview of the main research questions that are being investigated, and formal and unified definitions of the most important technical concepts from the literature.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 9 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Proportional Representation in Rank Aggregation

    cs.GT 2025-08 conditional novelty 8.0 of 10

    New proportional rank aggregation rules PSB and FB guarantee that every input ranking, and even every group of rankings, is represented in the output ranking in proportion to its weight.

  2. Representation in Peer Selection: A Liquid Democracy Perspective

    cs.GT 2026-08 conditional novelty 7.0 of 10

    On delegation-based "liquid" approval profiles, the paper shows strong-EJR, Liquid Representation, and Individual Representation coincide, and that PAV, MES, and sequential Phragmén all satisfy them.

  3. Selecting Interlacing Committees

    cs.GT 2025-09 accept novelty 7.0 of 10

    Maximizing how many voter pairs a committee connects is NP-hard in general but polynomial-time solvable on left-right interval preferences, with tight approximation trade-offs against classic representation goals.

  4. Project Submission Games in Participatory Budgeting

    cs.GT 2025-08 conditional novelty 7.0 of 10

    For participatory budgeting with strategic project proposers, pure Nash equilibria are generally neither guaranteed nor efficiently decidable, but become tractable in single-project multiwinner settings.

  5. The Panel Complexity of Sortition: Is 12 Angry Men Enough?

    cs.GT 2025-04 conditional novelty 7.0 of 10

    A random panel of size roughly (1/epsilon)^2 times a logarithmic factor guarantees near-optimal social outcomes with high probability, with matching lower bounds in participatory budgeting and facility location.

  6. Proportional Fairness for Harmful Decisions

    cs.GT 2026-07 accept novelty 6.0 of 10

    For divisible public bads, proportional fairness and Lindahl equilibrium coincide; a flipped Nash-welfare rule satisfies the completion core on all instances.

  7. Generative Social Choice: The Next Generation

    cs.GT 2025-05 conditional novelty 6.0 of 10

    The authors design a democratic process that uses approximate AI-driven queries to select a budget-limited slate of statements with provable approximate proportionality guarantees, and they test it with GPT-4o on real...

  8. Full Proportional Justified Representation

    cs.GT 2025-01 conditional novelty 6.0 of 10

    A new axiom, Full Proportional Justified Representation, fills the fourth cell in the justified-representation taxonomy; priceable rules and Monroe's rule satisfy it, while PAV does not.

  9. Learning Aggregation Rules in Participatory Budgeting: A Data-Driven Approach

    cs.LG 2024-12 conditional novelty 6.0 of 10

    A Set Transformer learns participatory budgeting aggregation rules from labeled examples and can approximate compromise rules such as a 30-70 AV-CC blend close to PAV.

Pith tools