arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.05213cs.GTcs.AIcs.DScs.MA

带有项目组的参与式预算

Participatory Budgeting with Project Groups

Indian Institute of Technology Jodhpur(印度理工学院焦特布尔分校);AGH University(AGH大学);Ben-Gurion University(本-古里安大学)

Pallavi Jain, Krzysztof Sornat, Nimrod Talmon, Meirav Zehavi

AI总结:

研究带有项目组的参与式预算模型,在遵守预算限制下确定使选民满意度最大化的项目捆绑的计算复杂性,给出特殊情况的精确算法和近似算法,可助市政当局开展更丰富的PB流程。

摘要:

我们研究了参与式预算(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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑