论文标题
与项目组的参与预算
Participatory Budgeting with Project Groups
论文作者
论文摘要
我们研究了基于标准批准的参与式预算模型（PB）的概括，在该模型中，选民正在对一组预定义的项目进行批准投票，除了全球预算限制外，项目的几个分组，每个小组都具有其自身的预算限制。我们研究了确定项目捆绑包的计算复杂性，这些项目捆绑包在尊重所有预算限制的同时，最大程度地提高了选民满意度。我们表明，问题通常是棘手的，并描述了几种特殊情况的有效精确算法，包括只有几个组和实例组结构接近层次结构的实例，以及有效的近似算法。我们的结果可以允许市政当局拥有更丰富的PB流程，这些过程在主题和地理上包含在内。
We study a generalization of the standard approval-based model of participatory budgeting (PB), in which voters are providing approval ballots over a set of predefined projects and -- in addition to a global budget limit, there are several groupings of the projects, each group with its own budget limit. We study the computational complexity of identifying project bundles that maximize voter satisfaction while respecting all budget limits. We show that the problem is generally intractable and describe efficient exact algorithms for several special cases, including instances with only few groups and instances where the group structure is close to be hierarchical, as well as efficient approximation algorithms. Our results could allow, e.g., municipalities to hold richer PB processes that are thematically and geographically inclusive.
