Participatory budgeting with project groups

DOI10.1016/J.JCSS.2025.103702MaRDI QIDQ6885373zbMATH OpenFDO

Authors Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi

Publication date 11 December 2025

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2025.103702

zbMATH Keywords

\(d\)-dimensional knapsackapproximation algorithmscomputational complexitycomputational social choiceparameterized complexityparticipatory budgeting

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Combinatorial optimization (90C27) Social choice (91B14)

Cites work

• Approval balloting for multi-winner elections
• Electing a committee with dominance constraints
• Fast Approximation Algorithms for Knapsack Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Fault-tolerant facility location
• Fixed-parameter tractability and completeness II: On completeness for W[1]
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2011853 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• Introduction to algorithms.
• Linear degree extractors and the inapproximability of max clique and chromatic number
• Lower bounds based on the exponential time hypothesis
• Minkowski's Convex Body Theorem and Integer Programming
• Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
• On the simulataneous election of several candidates.
• Parameterized algorithms
• Planar capacitated dominating set is \(W[1]\)-hard
• Proportional approval voting, harmonic \(k\)-median, and negative association
• The NP-Completeness of Edge-Coloring
• There is no EPTAS for two-dimensional knapsack

This page was built for publication: Participatory budgeting with project groups

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