Knapsack voting

Wikipedia has an article on:

Participatory budgeting algorithm

Knapsack voting is a participatory budgeting method based on approval voting. It was formally described by Goel et al. and has been used in Europe prior to Goel's paper.^[1]

Under some utility models, it is strategy-proof. It does, however, require that budget items can be partially funded: if the items can only either be fully funded or not at all, the result no longer holds.

This page is a stub - please add to it.

References

↑ Goel, Ashish; Krishnaswamy, Anilesh K.; Sakshuwong, Sukolsak; Aitamurto, Tanja (2019). "Knapsack Voting for Participatory Budgeting". ACM Transactions on Economics and Computation. Association for Computing Machinery (ACM). 7 (2): 1–27. doi:10.1145/3340230. ISSN 2167-8375.

[Goel_Krishnaswamy_Sakshuwong_Aitamurto_2019_pp._1–27-1] Goel, Ashish; Krishnaswamy, Anilesh K.; Sakshuwong, Sukolsak; Aitamurto, Tanja (2019). "Knapsack Voting for Participatory Budgeting". ACM Transactions on Economics and Computation. Association for Computing Machinery (ACM). 7 (2): 1–27. doi:10.1145/3340230. ISSN 2167-8375.

[1]