English
Related papers

Related papers: Strategic Cost Selection in Participatory Budgetin…

200 papers

In resource buying games a set of players jointly buys a subset of a finite resource set E (e.g., machines, edges, or nodes in a digraph). The cost of a resource e depends on the number (or load) of players using e, and has to be paid…

Computer Science and Game Theory · Computer Science 2012-04-19 Tobias Harks , Britta Peis

In the Binary Networked Public Goods game, every player needs to decide if she participates in a public project whose utility is shared equally by the community. We study the problem of deciding if there exists a pure strategy Nash…

Computer Science and Game Theory · Computer Science 2021-12-21 Arnab Maiti , Palash Dey

Participatory budgeting (PB) is a democratic process where citizens jointly decide on how to allocate public funds to indivisible projects. This paper focuses on PB processes where citizens may give additional money to projects they want to…

Multiagent Systems · Computer Science 2021-05-03 Jiehua Chen , Martin Lackner , Jan Maly

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

When can cooperation arise from self-interested decisions in public goods games? And how can we help agents to act cooperatively? We examine these classical questions in a pivotal participation game, a variant of public good games, where…

Computer Science and Game Theory · Computer Science 2021-08-27 Yiling Chen , Biaoshuai Tao , Fang-Yi Yu

In participatory budgeting (PB), voters decide through voting which subset of projects to fund within a given budget. Proportionality in the context of PB is crucial to ensure equal treatment of all groups of voters. However, pure…

Computer Science and Game Theory · Computer Science 2025-07-08 Georgios Papasotiropoulos , Seyedeh Zeinab Pishbin , Oskar Skibski , Piotr Skowron , Tomasz Wąs

We study the complexity of candidate control in participatory budgeting elections. The goal of constructive candidate control is to ensure that a given candidate wins by either adding or deleting candidates from the election (in the…

Computer Science and Game Theory · Computer Science 2026-01-26 Piotr Faliszewski , Łukasz Janeczko , Dušan Knop , Jan Pokorný , Šimon Schierreich , Mateusz Słuszniak , Krzysztof Sornat

We study a general scenario of simultaneous contests that allocate prizes based on equal sharing: each contest awards its prize to all players who satisfy some contest-specific criterion, and the value of this prize to a winner decreases as…

Computer Science and Game Theory · Computer Science 2022-07-19 Edith Elkind , Abheek Ghosh , Paul W. Goldberg

Participatory Budgeting (PB) has evolved into a key democratic instrument for resource allocation in cities. Enabled by digital platforms, cities now have the opportunity to let citizens directly propose and vote on urban projects, using…

Human-Computer Interaction · Computer Science 2024-10-14 Joshua C. Yang , Carina I. Hausladen , Dominik Peters , Evangelos Pournaras , Regula Hänggli Fricker , Dirk Helbing

We study voting rules for participatory budgeting, where a group of voters collectively decides which projects should be funded using a common budget. We allow the projects to have arbitrary costs, and the voters to have arbitrary additive…

Computer Science and Game Theory · Computer Science 2022-10-18 Dominik Peters , Grzegorz Pierczyński , Piotr Skowron

Participatory Budgeting (PB) is a form of participatory democracy in which citizens select a set of projects to be implemented, subject to a budget constraint. The Method of Equal Shares (MES), introduced in [18], is a simple iterative…

Computer Science and Game Theory · Computer Science 2023-10-17 Sonja Kraiczy , Edith Elkind

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 the computational complexity of strategic behaviour in primary elections. Unlike direct voting systems, primaries introduce a multi-stage process in which voters first influence intra-party nominees before a general election…

Computer Science and Game Theory · Computer Science 2026-02-12 Colin Cleveland , Bart de Keijzer , Maria Polukarov

We study low sample complexity mechanisms in participatory budgeting (PB), where each voter votes for a preferred allocation of funds to various projects, subject to project costs and total spending constraints. We analyze the distortion…

Computer Science and Game Theory · Computer Science 2023-06-27 Mohak Goyal , Sukolsak Sakshuwong , Sahasrajit Sarmasarkar , Ashish Goel

Bidding in simultaneous auctions is challenging because an agent's value for a good in one auction may depend on the uncertain outcome of other auctions: the so-called exposure problem. Given the gap in understanding of general simultaneous…

Computer Science and Game Theory · Computer Science 2012-10-19 Michael P. Wellman , Eric Sodomka , Amy Greenwald

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

We study the strategic purchasing of priorities in a time-dependent accumulating priority M/G/$1$ queue. We formulate a non-cooperative game in which customers purchase priority coefficients with the goal of reducing waiting costs in…

Computer Science and Game Theory · Computer Science 2017-04-12 Moshe Haviv , Liron Ravner

We introduce the concept of budget games. Players choose a set of tasks and each task has a certain demand on every resource in the game. Each resource has a budget. If the budget is not enough to satisfy the sum of all demands, it has to…

Computer Science and Game Theory · Computer Science 2014-07-14 Maximilian Drees , Sören Riechers , Alexander Skopalik

In this work we study of competitive situations among users of a set of global resources. More precisely we study the effect of cost policies used by these resources in the convergence time to a pure Nash equilibrium. The work is divided in…

Computer Science and Game Theory · Computer Science 2011-03-28 Vissarion Fisikopoulos

A central question in algorithmic game theory is to measure the inefficiency (ratio of costs) of Nash equilibria (NE) with respect to socially optimal solutions. The two established metrics used for this purpose are price of anarchy (POA)…

Data Structures and Algorithms · Computer Science 2016-11-24 Shuchi Chawla , Joseph , Naor , Debmalya Panigrahi , Mohit Singh , Seeun William Umboh