• Corpus ID: 233476312

Participatory Budgeting with Donations and Diversity Constraints

  title={Participatory Budgeting with Donations and Diversity Constraints},
  author={Jiehua Chen and Martin Lackner and Jan Maly},
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 see funded. We introduce a formal framework for this kind of PB with donations. Our framework also allows for diversity constraints, meaning that each project belongs to one or more types, and there are lower and upper bounds on the number of projects of the… 

Tables from this paper


Participatory Budgeting: Models and Approaches
A mathematical model for participatory budgeting is presented, which charts existing models across different axes including whether the projects are treated as “divisible’ or “indivisible” and whether there are funding limits on individual projects.
Truthful Aggregation of Budget Proposals
This paper seeks budget aggregation mechanisms that are incentive compatible when each voter's disutility for a budget division is equal to the 1 distance between that division and the division she prefers most, and defines a notion of proportionality to capture this idea of fairness.
Participatory budgeting: a significant contribution to participatory democracy
This paper describes participatory budgeting in Brazil and elsewhere as a significant area of innovation in democracy and local development. It draws on the experience of 25 municipalities in Latin
Knapsack Voting : Voting mechanisms for Participatory Budgeting
This work addresses the question of aggregating the preferences of voters in the context of participatory budgeting, and introduces a novel scheme tailored to this setting, which it calls “Knapsack Voting”, which is strategy-proof under a natural model of utility, and “partially” strategy- proof under general additive utilities.
Proportionally Representative Participatory Budgeting: Axioms and Algorithms
This work observes a rich landscape with respect to the computational complexity of identifying proportional budgets and computing such, and presents budgeting methods that satisfy axioms by identifying budgets that are representative to the demands of vast segments of the voters.
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
It is proved that SMTI-Diverse is beyond NP: it is complete for the complexity class $\Sigma^{\text{P}}_2$.
Balanced Ranking with Diversity Constraints
This paper introduces additional constraints, aimed at balancing the in-group fairness across groups, and formalizes the induced optimization problems as integer linear programs, and conducts an experimental evaluation with real datasets.
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP
It follows that determining the winner in Carroll's elections is not NP-complete unless the polynomial hierarchy collapses, and the stronger lower bound and upper bound are provided that matches the lower bound.