English
Related papers

Related papers: Participatory Budgeting with Cumulative Votes

200 papers

In the committee voting setting, a subset of $k$ alternatives is selected based on the preferences of voters. In this paper, our goal is to efficiently compute $\textit{ex-ante}$ fair probability distributions over committees. We introduce…

Computer Science and Game Theory · Computer Science 2024-12-30 Mashbat Suzuki , Jeremy Vollen

We study a budget-aggregation setting in which a number of voters report their ideal distribution of a budget over a set of alternatives, and a mechanism aggregates these reports into an allocation. Ideally, such mechanisms are truthful,…

Computer Science and Game Theory · Computer Science 2024-07-26 Mark de Berg , Rupert Freeman , Ulrike Schmidt-Kraepelin , Markus Utke

We study the design and approximation of optimal crowdsourcing contests. Crowdsourcing contests can be modeled as all-pay auctions because entrants must exert effort up-front to enter. Unlike all-pay auctions where a usual design objective…

Computer Science and Game Theory · Computer Science 2011-11-15 Shuchi Chawla , Jason D. Hartline , Balasubramanian Sivan

In a cost sharing problem on a weighted undirected graph, all other nodes want to connect to the source node for some service. Each edge has a cost denoted by a weight and all the connected nodes should share the total cost for the…

Computer Science and Game Theory · Computer Science 2023-11-16 Tianyi Zhang , Dengji Zhao , Junyu Zhang , Sizhe Gu

A key aspect for any greedy pursuit algorithm used in compressed sensing is a good support-set detection method. For distributed compressed sensing, we consider a setup where many sensors measure sparse signals that are correlated via the…

Information Theory · Computer Science 2014-07-18 Dennis Sundman , Saikat Chatterjee , Mikael Skoglund

In parliamentary elections, parties compete for a limited, typically fixed number of seats. Most parliaments are assembled using apportionment methods that distribute the seats based on the parties' vote counts. Common apportionment methods…

Crowdsourcing systems, in which numerous tasks are electronically distributed to numerous "information piece-workers", have emerged as an effective paradigm for human-powered solving of large scale problems in domains such as image…

Machine Learning · Computer Science 2013-03-27 David R. Karger , Sewoong Oh , Devavrat Shah

We focus on the strategyproofness of voting systems where voters must choose a number of options among several possibilities. These systems include those that are used for Participatory Budgeting, where we organize an election to determine…

Computer Science and Game Theory · Computer Science 2022-10-07 Johanne Cohen , Daniel Cordeiro , Valentin Dardilhac , Victor Glaser

We study the effects of campaigning, where the society is partitioned into voter clusters and a diffusion process propagates opinions in a network connecting the clusters. Our model is very powerful and can incorporate many campaigning…

Multiagent Systems · Computer Science 2020-10-05 Piotr Faliszewski , Rica Gonen , Martin Koutecký , Nimrod Talmon

In 2023, Open AIs Democratic Inputs program funded 10 teams to design procedures for public participation in generative AI. In this Perspective, we review the results of the project, drawing on interviews with some of the teams and our own…

Computers and Society · Computer Science 2025-03-06 David Moats , Chandrima Ganguly

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

Peer reviews, evaluations, and selections are a fundamental aspect of modern science. Funding bodies the world over employ experts to review and select the best proposals from those submitted for funding. The problem of peer selection,…

Computer Science and Game Theory · Computer Science 2019-05-01 Haris Aziz , Omer Lev , Nicholas Mattei , Jeffrey S. Rosenschein , Toby Walsh

We address an optimization problem where the cost function is the expectation of a random mapping. To tackle the problem two approaches based on the approximation of the objective function by consensus-based particle optimization methods on…

Optimization and Control · Mathematics 2025-11-24 Sabrina Bonandin , Michael Herty

Many applications require the collection of data on different variables or measurements over many system performance metrics. We term those broadly as measures or variables. Often data collection along each measure incurs a cost, thus it is…

Methodology · Statistics 2021-11-30 Donghui Yan , Zhiwei Qin , Songxiang Gu , Haiping Xu , Ming Shao

We present a new optimization-based method for aggregating preferences in settings where each voter expresses preferences over pairs of alternatives. Our approach to identifying a consensus partial order is motivated by the observation that…

Social and Information Networks · Computer Science 2025-01-28 Nathan Atkinson , Scott C. Ganz , Dorit S. Hochbaum , James B. Orlin

Strategic manipulation of elections is typically studied in the context of promoting individual candidates. In parliamentary elections, however, the focus shifts: voters may care more about the overall governing coalition than the…

Computer Science and Game Theory · Computer Science 2026-01-13 Hodaya Barr , Eden Hartman , Yonatan Aumann , Sarit Kraus

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

Market-based mechanisms such as auctions are being studied as an appropriate means for resource allocation in distributed and mulitagent decision problems. When agents value resources in combination rather than in isolation, they must often…

Artificial Intelligence · Computer Science 2013-01-30 Craig Boutilier , Moises Goldszmidt , Bikash Sabata

Allowing members of the crowd to propose novel microtasks for one another is an effective way to combine the efficiencies of traditional microtask work with the inventiveness and hypothesis generation potential of human workers. However,…

Human-Computer Interaction · Computer Science 2020-12-23 Abigail Hotaling , James P. Bagrow

Voter control problems model situations in which an external agent tries toaffect the result of an election by adding or deleting the fewest number of voters. The goal of the agent is to make a specific candidate either win…

Multiagent Systems · Computer Science 2017-01-19 Leon Kellerhals , Viatcheslav Korenwein , Philipp Zschoche , Robert Bredereck , Jiehua Chen