Coordinating monetary contributions in participatory budgeting
From MaRDI portal
Publication:6546284
Recommendations
Cites work
- A note on the set union knapsack problem
- An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents
- Cost sharing over combinatorial domains : Complement-free cost functions and beyond
- Fast Approximation Algorithms for Knapsack Problems
- Funding public projects: a case for the Nash product rule
- scientific article; zbMATH DE number 3650233 (Why is no real title available?)
- scientific article; zbMATH DE number 698819 (Why is no real title available?)
- Incentives in Teams
- Is Shapley cost sharing optimal?
- On complexity of single-minded auction
- Participatory funding coordination: model, axioms and rules
- Properties of multiwinner voting rules
- Serial Cost-Sharing of Excludable Public Goods
- The Knapsack Problem with Conflict Graphs
Cited in
(4)
This page was built for publication: Coordinating monetary contributions in participatory budgeting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546284)