(New) 29 September 2022, Computational Social Choice Seminar, Sreedurga Gogulapati
We introduce three families of rules for indivisible participatory budgeting with weak ordinal ballots. The first family can be viewed as an extension of knapsack voting, the second one captures the desirability of economic projects, and the third one encapsulates fairness. Following the introduction, the talk will briefly cover the results on the computational complexity and axiomatic analysis of these families of rules.
For more information on the Computational Social Choice Seminar, please consult https://staff.science.uva.nl/u.endriss/seminar/.