English
Related papers

Related papers: Coordinating Monetary Contributions in Participato…

200 papers

Participatory budgeting is a method used by city governments to select public projects to fund based on residents' votes. Many cities use participatory budgeting at a district level. Typically, a budget is divided among districts…

Computer Science and Game Theory · Computer Science 2021-02-12 D Ellis Hershkowitz , Anson Kahng , Dominik Peters , Ariel D. Procaccia

We study a participatory budgeting problem of aggregating the preferences of agents and dividing a budget over the projects. A budget division solution is a probability distribution over the projects. The main purpose of our study concerns…

Computer Science and Game Theory · Computer Science 2020-11-02 Zhongzheng Tang , Chenhao Wang , Mengqi Zhang

Civic Crowdfunding (CC) uses the ``power of the crowd'' to garner contributions towards public projects. As these projects are non-excludable, agents may prefer to ``free-ride,'' resulting in the project not being funded. For single project…

Computer Science and Game Theory · Computer Science 2022-11-28 Sankarshan Damle , Manisha Padala , Sujit Gujar

Collective decision-making is the process through which diverse stakeholders reach a joint decision. Within societal settings, one example is participatory budgeting, where constituents decide on the funding of public projects. How to most…

Theoretical Economics · Economics 2024-09-23 Yurun Ge , Lucas Böttcher , Tom Chou , Maria R. D'Orsogna

Participatory budgeting is one of the exciting developments in deliberative grassroots democracy. We concentrate on approval elections and propose proportional representation axioms in participatory budgeting, by generalizing relevant…

Computer Science and Game Theory · Computer Science 2017-11-23 Haris Aziz , Barton Lee , Nimrod Talmon

We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common economic situations, and yet it has not been studied, to our…

Computer Science and Game Theory · Computer Science 2013-12-02 Yaron Singer

Ensemble-based approaches are very effective in various fields in raising the accuracy of its individual members, when some voting rule is applied for aggregating the individual decisions. In this paper, we investigate how to find and…

Artificial Intelligence · Computer Science 2019-04-10 Attila Tiba , Andras Hajdu , Gyorgy Terdik , Henrietta Toman

The problem of computing near-optimal contracts in combinatorial settings has recently attracted significant interest in the computer science community. Previous work has provided a rich body of structural and algorithmic insights into this…

Computer Science and Game Theory · Computer Science 2025-06-26 Michal Feldman , Yoav Gal-Tzur , Tomasz Ponitka , Maya Schlesinger

Traditional studies of combinatorial auctions often only consider linear constraints. The rise of smart grid presents a new class of auctions, characterized by quadratic constraints. This paper studies the {\em complex-demand knapsack…

Computer Science and Game Theory · Computer Science 2017-09-25 Chi-Kin Chau , Khaled Elbassioni , Majid Khonji

We study the power of item-pricing as a tool for approximately optimizing social welfare in a combinatorial market. We consider markets with $m$ indivisible items and $n$ buyers. The goal is to set prices to the items so that, when agents…

Computer Science and Game Theory · Computer Science 2015-11-10 Michal Feldman , Nick Gravin , Brendan Lucier

Participatory Budgeting (PB) offers a democratic process for communities to allocate public funds across various projects through voting. In practice, PB organizers face challenges in selecting aggregation rules either because they are not…

Machine Learning · Computer Science 2024-12-04 Roy Fairstein , Dan Vilenchik , Kobi Gal

Budget feasible mechanisms, recently initiated by Singer (FOCS 2010), extend algorithmic mechanism design problems to a realistic setting with a budget constraint. We consider the problem of designing truthful budget feasible mechanisms for…

Computer Science and Game Theory · Computer Science 2010-07-23 Ning Chen , Nick Gravin , Pinyan Lu

Combinatorial contracts are emerging as a key paradigm in algorithmic contract design, paralleling the role of combinatorial auctions in algorithmic mechanism design. In this paper we study natural combinatorial contract settings involving…

Computer Science and Game Theory · Computer Science 2024-05-15 Paul Duetting , Tomer Ezra , Michal Feldman , Thomas Kesselheim

Traditional studies of combinatorial auctions often only consider linear constraints (by which the demands for certain goods are limited by the corresponding supplies). The rise of smart grid presents a new class of auctions, characterized…

Computer Science and Game Theory · Computer Science 2014-11-27 Chi-Kin Chau , Khaled Elbassioni , Majid Khonji

We study budget aggregation under $\ell_1$-utilities, a model for collective decision making in which agents with heterogeneous preferences must allocate a public budget across a set of alternatives. Each agent reports their preferred…

Computer Science and Game Theory · Computer Science 2026-02-27 Javier Cembrano , Rupert Freeman , Ulrike Schmidt-Kraepelin , Markus Utke

Participatory Budgeting (PB) is a popular voting method by which a limited budget is divided among a set of projects, based on the preferences of voters over the projects. PB is broadly categorised as divisible PB (if the projects are…

Computer Science and Game Theory · Computer Science 2022-05-02 Gogulapati Sreedurga , Mayank Ratan Bhardwaj , Y. Narahari

We propose a new model for aggregating preferences over a set of indivisible items based on a quantile value. In this model, each agent is endowed with a specific quantile, and the value of a given bundle is defined by the corresponding…

Computer Science and Game Theory · Computer Science 2026-05-06 Haris Aziz , Shivika Narang , Mashbat Suzuki

We make three different types of contributions to cost-sharing: First, we identify several new classes of combinatorial cost functions that admit incentive-compatible mechanisms achieving both a constant-factor approximation of…

Computer Science and Game Theory · Computer Science 2007-05-23 Tim Roughgarden , Mukund Sundararajan

We initiate the study of voting rules for participatory budgeting using the so-called epistemic approach, where one interprets votes as noisy reflections of some ground truth regarding the objectively best set of projects to fund. Using…

Computer Science and Game Theory · Computer Science 2024-09-05 Simon Rey , Ulle Endriss

We study mechanism design for combinatorial cost sharing. Imagine that multiple items or services are available to be shared among a set of interested agents. The outcome of a mechanism in this setting consists of an assignment, determining…

Computer Science and Game Theory · Computer Science 2019-10-16 Georgios Birmpas , Evangelos Markakis , Guido Schäfer