Partition Aggregation for Budgeting
Résumé
Motivated by certain aggregation tasks related to participatory budgeting, such as clustering projects and modeling project interactions, we study several variants of the following aggregation problem: Given a set P of m projects, and n partitions of P , the task is to aggregate these n partitions into one aggregated partition. We consider several aggregation methods for this setting, including utility-based methods and Condorcet-based methods and evaluate these methods by analyzing their computational complexity and their behavior with respect to certain relevant axiomatic properties.
Origine : Fichiers produits par l'(les) auteur(s)