{"type":"ScholarlyArticle","title":"Participatory Budgeting with Project Interactions","authors":[{"name":"Pallavi Jain","slug":"pallavi-jain","given":"Pallavi","family":"Jain","affiliation":"Ben-Gurion University , Israel"},{"name":"Krzysztof Sornat","slug":"krzysztof-sornat","given":"Krzysztof","family":"Sornat","affiliation":"Ben-Gurion University , Israel"},{"name":"Nimrod Talmon","slug":"nimrod-talmon","given":"Nimrod","family":"Talmon","affiliation":"Ben-Gurion University , Israel"}],"abstract":"Participatory budgeting systems allow city residents to jointly decide on projects they wish to fund using public money, by letting residents vote on such projects. While participatory budgeting is gaining popularity, existing aggregation methods do not take into account the natural possibility of project interactions, such as substitution and complementarity effects. Here we take a step towards fixing this issue: First, we augment the standard model of participatory budgeting by introducing a partition over the projects and model the type and extent of project interactions within each part using certain functions. We study the computational complexity of finding bundles that maximize voter utility, as defined with respect to such functions. Motivated by the desire to incorporate project interactions in real-world participatory budgeting systems, we identify certain cases that admit efficient aggregation in the presence of such project interactions.","doi":"10.24963/ijcai.2020/54","url":"https://ijcai.org/proceedings/2020/54","pdf":"https://ijcai.org/proceedings/2020/0054.pdf","markdown":"https://ijcai.org/proceedings/2020/54.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/54","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":54,"pages":{"first":386,"last":392},"keywords":["Agent-based and Multi-agent Systems: Computational Social Choice"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/25390/file_25390.m3u8","length_sec":266,"provider":"hls"}],"references":[{"position":1,"raw":"[Aziz et al., 2018] Haris Aziz, Barton E. Lee, and Nimrod Talmon. Proportionally representative participatory bud- geting: Axioms and algorithms. In AAMAS, pages 23-31, 2018.","title":"Proportionally representative participatory budgeting: Axioms and algorithms","authors":"Haris Aziz, Barton E Lee, Nimrod Talmon","year":"2018","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Aziz, 2019] Haris Aziz. A rule for committee selection with soft diversity constraints. Group Decis. Negot., 28(6):1193-1200, 2019.","title":"A rule for committee selection with soft diversity constraints","authors":"Haris Aziz","year":"2019","venue":"Group Decis. Negot","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bonnet et al., 2016] Édouard Bonnet, Vangelis Th. Paschos, and Florian Sikora. Parameterized exact and approxima- tion algorithms for Maximum k-Set Cover and related sat- isfiability problems. RAIRO -Theor. Inf. and Applic., 50(3):227-240, 2016.","title":"Parameterized exact and approximation algorithms for Maximum k-Set Cover and related satisfiability problems","authors":"Édouard Bonnet, Vangelis Th, Florian Paschos, Sikora","year":"2016","venue":"RAIRO -Theor. Inf. and Applic","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bredereck et al., 2020] Robert Bredereck, Piotr Fal- iszewski, Rolf Niedermeier, Piotr Skowron, and Nimrod Talmon. Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting. Theor. Comput. Sci., 814:86-105, 2020.","title":"Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting","authors":"Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Piotr Skowron, Nimrod Talmon","year":"2020","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Cabannes, 2004] Yves Cabannes. Participatory budgeting: A significant contribution to participatory democracy. En- viron. Urban., 16(1):27-46, 2004.","title":"Participatory budgeting: A significant contribution to participatory democracy","authors":"Yves Cabannes, Cabannes","year":"2004","venue":"Environ. Urban","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[De Vries and Vohra, 2003] Sven De Vries and Rakesh V Vohra. Combinatorial auctions: A survey. INFORMS J. Comput., 15(3):284-309, 2003.","title":"Combinatorial auctions: A survey","authors":"De Vries, ; ] Vohra, De Sven, Vries, V Rakesh, Vohra","year":"2003","venue":"INFORMS J. Comput","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Dudycz et al., 2020] Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, and Krzysztof Sornat. Tight approx- imation for Proportional Approval Voting. In IJCAI, 2020.","title":"Tight approximation for Proportional Approval Voting","authors":"Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Krzysztof Sornat","year":"2020","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2020/39"},{"position":8,"raw":"[Elkind and Lackner, 2015] Edith Elkind and Martin Lack- ner. Structure in dichotomous preferences. In IJCAI, pages 2019-2025, 2015.","title":"Structure in dichotomous preferences","authors":"Lackner Elkind","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/286"},{"position":9,"raw":"[Faliszewski et al., 2017] Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, and Nimrod Talmon. Multiwinner voting: A new challenge for social choice theory. In U. Endriss, editor, Trends in Computational Social Choice. AI Access Foundation, 2017.","title":"Multiwinner voting: A new challenge for social choice theory","authors":"Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon","year":"2017","venue":"Trends in Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Ganuza and Baiocchi, 2012] Ernesto Ganuza and Gian- paolo Baiocchi. The power of ambiguity: How partici- patory budgeting travels the globe. J. Public Deliberation, 8(2):8:1-8:12, 2012.","title":"The power of ambiguity: How participatory budgeting travels the globe","authors":"Baiocchi Ganuza","year":"2012","venue":"J. Public Deliberation","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Goel et al., 2019] Ashish Goel, Anilesh K. Krishnaswamy, Sukolsak Sakshuwong, and Tanja Aitamurto. Knapsack voting for participatory budgeting. ACM Trans. Economics and Comput., 7(2):8:1-8:27, 2019.","title":"Knapsack voting for participatory budgeting","authors":"Ashish Goel, Anilesh K Krishnaswamy, Sukolsak Sakshuwong, Tanja Aitamurto","year":"2019","venue":"ACM Trans. Economics and Comput","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Impagliazzo et al., 2001] Russell Impagliazzo, Ramamo- han Paturi, and Francis Zane. Which problems have strongly exponential complexity? J. Comput. Syst. Sci., 63(4):512-530, 2001.","title":"Which problems have strongly exponential complexity?","authors":"Russell Impagliazzo, Ramamohan Paturi, Francis Zane","year":"2001","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Izsak et al., 2018] Rani Izsak, Nimrod Talmon, and Ger- hard J. Woeginger. Committee selection with intraclass and interclass synergies. In AAAI, pages 1071-1078, 2018.","title":"Committee selection with intraclass and interclass synergies","authors":"Rani Izsak, Nimrod Talmon, Gerhard J Woeginger","year":"2018","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Izsak, 2017] Rani Izsak. Working together: Committee se- lection and the supermodular degree. In AAMAS, pages 103-115, 2017.","title":"Working together: Committee selection and the supermodular degree","authors":"Rani Izsak","year":"2017","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Lenstra Jr, 1983] Hendrik W Lenstra Jr. Integer program- ming with a fixed number of variables. Math. Oper. Res., 8(4):538-548, 1983.","title":"Integer programming with a fixed number of variables","authors":"Lenstra Jr, ; Hendrik, W Lenstra","year":"1983","venue":"Math. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Manurangsi, 2017] Pasin Manurangsi. Almost-polynomial ratio ETH-hardness of approximating Densest k- Subgraph. In STOC, pages 954-961, 2017.","title":"Almost-polynomial ratio ETH-hardness of approximating Densest k-Subgraph","authors":"Pasin Manurangsi","year":"2017","venue":"STOC","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Manurangsi, 2020] Pasin Manurangsi. Tight running time lower bounds for strong inapproximability of Maximum k-Coverage, Unique Set Cover and related problems (via t-Wise Agreement Testing Theorem). In SODA, pages 62- 81, 2020.","title":"Tight running time lower bounds for strong inapproximability of Maximum k-Coverage, Unique Set Cover and related problems (via t-Wise Agreement Testing Theorem)","authors":"Pasin Manurangsi","year":"2020","venue":"SODA","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Russon Gilman, 2012] Hollie Russon Gilman. Transforma- tive deliberations: Participatory budgeting in the United States. J. Public Deliberation, 8(2):11:1-11:20, 2012.","title":"Transformative deliberations: Participatory budgeting in the United States","authors":"Hollie Russon, Gilman","year":"2012","venue":"J. Public Deliberation","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Sintomer et al., 2008] Yves Sintomer, Carsten Herzberg, and Anja Röcke. Participatory budgeting in Europe: Po- tentials and challenges. Int. J. Urban Reg. Res., 32(1):164- 178, 2008.","title":"Participatory budgeting in Europe: Potentials and challenges","authors":"Sintomer","year":"2008","venue":"Int. J. Urban Reg. Res","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Skowron et al., 2016] Piotr Skowron, Piotr Faliszewski, and Jérôme Lang. Finding a collective set of items: From pro- portional multirepresentation to group recommendation. Artif. Intell., 241:191-216, 2016.","title":"Finding a collective set of items: From proportional multirepresentation to group recommendation","authors":"Piotr Skowron, Piotr Faliszewski, Jérôme Lang","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Sviridenko, 2004] Maxim Sviridenko. A note on maximiz- ing a submodular set function subject to a knapsack con- straint. Oper. Res. Lett., 32(1):41-43, 2004.","title":"A note on maximizing a submodular set function subject to a knapsack constraint","authors":"Maxim Sviridenko","year":"2004","venue":"Oper. Res. Lett","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Talmon and Faliszewski, 2019] Nimrod Talmon and Piotr Faliszewski. A framework for approval-based budgeting methods. In AAAI, pages 2181-2188, 2019.","title":"Nimrod Talmon and Piotr Faliszewski. A framework for approval-based budgeting methods","authors":"Faliszewski Talmon","year":"2019","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Wampler, 2010] Brian Wampler. Participatory Budgeting in Brazil: Contestation, Cooperation, and Accountability. Penn State Press, 2010.","title":"Participatory Budgeting in Brazil: Contestation, Cooperation, and Accountability","authors":"Brian Wampler","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}