Pith. sign in

REVIEW 1 cited by

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

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 2412.01864 v1 pith:FYZ6FFCJ submitted 2024-12-01 cs.LG cs.AIcs.CYcs.GT

classification cs.LGcs.AIcs.CYcs.GT
keywords rulesaggregationapproachexistingablebecausebudgetingdata-driven
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Participatory Budgeting (PB) offers a democratic process for communities to allocate public funds across various projects through voting. In practice, PB organizers face challenges in selecting aggregation rules either because they are not familiar with the literature and the exact details of every existing rule or because no existing rule echoes their expectations. This paper presents a novel data-driven approach utilizing machine learning to address this challenge. By training neural networks on PB instances, our approach learns aggregation rules that balance social welfare, representation, and other societal beneficial goals. It is able to generalize from small-scale synthetic PB examples to large, real-world PB instances. It is able to learn existing aggregation rules but also generate new rules that adapt to diverse objectives, providing a more nuanced, compromise-driven solution for PB processes. The effectiveness of our approach is demonstrated through extensive experiments with synthetic and real-world PB data, and can expand the use and deployment of PB solutions.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. What Voting Rules Actually Do: A Data-Driven Analysis of Multi-Winner Voting

    cs.AI 2025-08 unverdicted novelty 5.0 of 10

    A data-driven framework for counting axiom violations across preference distributions, with the claim that trained neural-network rules minimize violations better than traditional multi-winner rules.

Pith tools