Partition Aggregation for Participatory Budgeting

Recently, Jain et al. [IJCAI, 2019] studied the effect of project interactions in participatory budgeting (PB) by assuming an existing partition of the projects to interaction structures, namely a grouping of the projects into substitution and complementarity groups. Motivated by their study, here we take voter preferences to find such interaction structures. In our model, voters submit interaction structures, and the goal is to find an aggregated structure. Formally, given a set 𝑃 of 𝑚 projects, and 𝑛 partitions of 𝑃, the task is to aggregate these 𝑛 partitions into one aggregated partition. We consider this partition aggregation task both for substitution structures and for complementarity structures, studying several aggregation methods for each, including utility-based methods and Condorcet-based methods; we evaluate these methods by analyzing their computational complexity and their behavior with respect to certain relevant axiomatic properties.

Authors

• Pallavi Jain Indian Institute of Technology Jodhpur
• Nimrod Talmon Ben-Gurion University of the Negev
• Laurent Bulteau

Keywords

• Participatory Budgeting
• Project Interactions
• Computational Complexity
• Axiomatic analysis