Robustness of participatory budgeting outcomes: complexity and experiments

DOI10.1007/978-3-031-43254-5_10MaRDI QIDQ6546286zbMATH OpenFDO

Authors Niclas Boehmer, Piotr Faliszewski, Łukasz Janeczko, Andrzej Kaczmarczyk

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43254-5_10

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Experimental work for problems pertaining to game theory, economics, and finance (91-05) Public goods (91B18) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Complexity of manipulative interference in participatory budgeting
• The core of the participatory budgeting problem
• Coordinating monetary contributions in participatory budgeting
• Robustness of approval-based multiwinner voting rules

Cites work

• How hard is bribery in elections?
• Multi-winner voting with approval preferences
• Robustness among multiwinner voting rules
• Robustness of approval-based multiwinner voting rules
• The Parameterized Complexity of Counting Problems

Cited in

(5)

• Complexity of manipulative interference in participatory budgeting
• Auditing for core stability in participatory budgeting
• On the complexity of destructive bribery in approval-based multiwinner voting
• Parameterized analysis of bribery in \textit{Challenge the champ} tournaments
• A note on the method of equal shares

This page was built for publication: Robustness of participatory budgeting outcomes: complexity and experiments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546286)