Complexity of manipulative interference in participatory budgeting

DOI10.1007/978-3-030-87756-9_27MaRDI QIDQ2695465zbMATH OpenOpenAlexFDO

Authors Dorothea Baumeister, Linus Boes, Johanna Hillebrand

Publication date 31 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-87756-9_27

zbMATH Keywords

computational complexitycontrolparticipatory budgeting

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decision theory (91B06) Social choice (91B14) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Matching models (91B68)

Recommendations

• Robustness of participatory budgeting outcomes: complexity and experiments
• Coordinating monetary contributions in participatory budgeting
• The core of the participatory budgeting problem
• Cognitive hierarchy and voting manipulation in \(k\)-approval voting

Cites work

• Chamberlin-Courant rule with approval ballots: approximating the MaxCover problem with bounded frequencies in FPT time
• Computational Complexity
• Control and bribery in voting
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• The complexity of optimization problems

Cited in

(3)

• Coordinating monetary contributions in participatory budgeting
• Robustness of participatory budgeting outcomes: complexity and experiments
• Collective combinatorial optimisation as judgment aggregation

This page was built for publication: Complexity of manipulative interference in participatory budgeting

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