English
Related papers

Related papers: A Participatory Democratic Budgeting Algorithm

200 papers

We introduce BallotRank, a ranked preference aggregation method derived from a modified PageRank algorithm. It is a Condorcet-consistent method without damping, and empirical examination of nearly 2,000 ranked choice elections and over…

Computer Science and Game Theory · Computer Science 2026-01-22 Jason Douglas Todd , Ismar Volic

We consider the notions of agreement, diversity, and polarization in ordinal elections (that is, in elections where voters rank the candidates). While (computational) social choice offers good measures of agreement between the voters, such…

Computer Science and Game Theory · Computer Science 2023-05-18 Piotr Faliszewski , Andrzej Kaczmarczyk , Krzysztof Sornat , Stanisław Szufa , Tomasz Wąs

We present an alternative voting system that aims at bridging the gap between proportional representative systems and majoritarian, single winner election systems. The system lets people vote for multiple parties, but then assigns each…

Computer Science and Game Theory · Computer Science 2016-12-01 Pietro Speroni di Fenizio , Daniele A. Gewurz

We study a budget aggregation setting where voters express their preferred allocation of a fixed budget over a set of alternatives, and a mechanism aggregates these preferences into a single output allocation. Motivated by scenarios in…

Computer Science and Game Theory · Computer Science 2025-05-12 Ulrike Schmidt-Kraepelin , Warut Suksompong , Markus Utke

Budgeted uncertainty sets have been established as a major influence on uncertainty modeling for robust optimization problems. A drawback of such sets is that the budget constraint only restricts the global amount of cost increase that can…

Optimization and Control · Mathematics 2020-08-28 Marc Goerigk , Stefan Lendl

The mathematical study of voting, social choice theory, has traditionally only been applicable to choices among a few predetermined alternatives, but not to open-ended decisions such as collectively selecting a textual statement. We…

Computer Science and Game Theory · Computer Science 2025-03-07 Sara Fish , Paul Gölz , David C. Parkes , Ariel D. Procaccia , Gili Rusak , Itai Shapira , Manuel Wüthrich

Cumulative and quadratic voting are two distributional voting methods that are expressive, promoting fairness and inclusion, particularly in the realm of participatory budgeting. Despite these benefits, graphical voter interfaces for…

We present a deliberation model where a group of individuals with heterogeneous preferences iteratively forms expert committees whose members are tasked with the updating of an exogenously given status quo change proposal. Every individual…

Theoretical Economics · Economics 2022-04-05 Dimitrios Karoukis

We study a type of reverse (procurement) auction problems in the presence of budget constraints. The general algorithmic problem is to purchase a set of resources, which come at a cost, so as not to exceed a given budget and at the same…

Computer Science and Game Theory · Computer Science 2016-10-05 Georgios Amanatidis , Georgios Birmpas , Evangelos Markakis

The paper provides an overview of core functionalities that digital democracy software needs to provide in order to support democratic deliberative processes at scale. Developing these functionalities poses novel computational challenges…

Computers and Society · Computer Science 2026-05-05 Davide Grossi

This article surveys the use of algorithmic systems to support decision-making in the public sector. Governments adopt, procure, and use algorithmic systems to support their functions within several contexts -- including criminal justice,…

Computers and Society · Computer Science 2021-06-11 Karen Levy , Kyla Chasalow , Sarah Riley

Most democratic countries use election methods to transform election results into whole numbers which usually give the number of seats in a legislative body the parties obtained. Which election method does this best can be specified by…

History and Overview · Mathematics 2015-10-27 Horst F. Niemeyer , Alice C. Niemeyer

The challenge of finding compromises between agent proposals is fundamental to AI sub-fields such as argumentation, mediation, and negotiation. Building on this tradition, Elkind et al. (2021) introduced a process for coalition formation…

Multiagent Systems · Computer Science 2025-12-09 Eyal Briman , Ehud Shapiro , Nimrod Talmon

We are witnessing an increasing use of data-driven predictive models to inform decisions. As decisions have implications for individuals and society, there is increasing pressure on decision makers to be transparent about their decision…

Cryptocurrencies came to the world in the recent decade and attempted to offer a new order where the financial system is not governed by a centralized entity, and where you have complete control over your account without the need to trust…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-09-26 Asa Dan

We consider three algorithms for allocating parliamentary seats by proportional representation. The usual approach to describing such algorithms is to compute a quota of votes that each party uses to "acquire'' representatives. This kind of…

Data Structures and Algorithms · Computer Science 2023-11-07 Raul Rojas

A worldwide movement towards the publication of Open Government Data is taking place, and budget data is one of the key elements pushing this trend. Its importance is mostly related to transparency, but publishing budget data, combined with…

Computers and Society · Computer Science 2015-04-08 Alan Freihof Tygel , Judie Attard , Fabrizio Orlandi , Maria Luiza Machado Campos , Sören Auer

The boundaries of electoral constituencies for assembly and parliamentary seats are drafted using a process referred to as delimitation, which ensures fair and equal representation of all citizens. The current delimitation exercise suffers…

Data Structures and Algorithms · Computer Science 2024-02-19 Sahil Kale , Gautam Khaire , Jay Patankar , Pujashree Vidap

In this work, we consider the problem of minimising the social cost in atomic congestion games. For this problem, we provide tight computational lower bounds along with taxation mechanisms yielding polynomial time algorithms with optimal…

Computer Science and Game Theory · Computer Science 2022-05-23 Dario Paccagnan , Martin Gairing

We investigate the problem of computing the probability of winning in an election where voter attendance is uncertain. More precisely, we study the setting where, in addition to a total ordering of the candidates, each voter is associated…

Computer Science and Game Theory · Computer Science 2021-02-01 Aviram Imber , Benny Kimelfeld