English
Related papers

Related papers: Participatory Budget Allocation Method for Approva…

200 papers

We study the problem of {\em impartial selection}, a topic that lies at the intersection of computational social choice and mechanism design. The goal is to select the most popular individual among a set of community members. The input can…

Computer Science and Game Theory · Computer Science 2021-02-19 Ioannis Caragiannis , George Christodoulou , Nicos Protopapas

We study situations where a group of voters need to take a collective decision over a number of public issues, with the goal of getting a result that reflects the voters' opinions in a proportional manner. Our focus is on interconnected…

Computer Science and Game Theory · Computer Science 2025-09-25 Julian Chingoma , Umberto Grandi , Arianna Novaro

Budget aggregation is a process in which citizens vote by declaring their individual ideal budget allocation, and a pre-determined rule aggregates all votes into a single outcome. Recent theoretical work has proposed various aggregation…

Computer Science and Game Theory · Computer Science 2026-04-14 Ayelet Amster , Lioz Akirav , Rica Gonen , Erel Segal-Halevi

Given a set of items and a set of evaluators who all individually rank them, how do we aggregate these evaluations into a single societal ranking? Work in social choice and statistics has produced many aggregation methods for this problem,…

Computer Science and Game Theory · Computer Science 2025-08-26 Ratip Emin Berker , Ben Armstrong , Vincent Conitzer , Nihar B. Shah

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

Approval-like voting rules, such as Sincere-Strategy Preference-Based Approval voting (SP-AV), the Bucklin rule (an adaptive variant of $k$-Approval voting), and the Fallback rule (an adaptive variant of SP-AV) have many desirable…

Computer Science and Game Theory · Computer Science 2015-01-05 Ildikó Schlotter , Piotr Faliszewski , Edith Elkind

We model Monroe's and Chamberlin and Courant's multiwinner voting systems as a certain resource allocation problem. We show that for many restricted variants of this problem, under standard complexity-theoretic assumptions, there are no…

Computer Science and Game Theory · Computer Science 2013-01-29 Piotr Skowron , Piotr Faliszewski , Arkadii Slinko

Many societal decision problems lie in high-dimensional continuous spaces not amenable to the voting techniques common for their discrete or single-dimensional counterparts. These problems are typically discretized before running an…

Multiagent Systems · Computer Science 2018-10-30 Nikhil Garg , Vijay Kamble , Ashish Goel , David Marn , Kamesh Munagala

In party-approval multiwinner elections the goal is to allocate the seats of a fixed-size committee to parties based on the approval ballots of the voters over the parties. In particular, each voter can approve multiple parties and each…

Computer Science and Game Theory · Computer Science 2022-11-28 Théo Delemazure , Tom Demeulemeester , Manuel Eberl , Jonas Israel , Patrick Lederer

We study a two-alternative voting game where voters' preferences depend on an unobservable world state and each voter receives a private signal correlated to the true world state. We consider the collective decision when voters can…

Computer Science and Game Theory · Computer Science 2024-10-11 Xiaotie Deng , Biaoshuai Tao , Ying Wang

Respecting minority opinions is vital in solving social problems. However, minority opinions are often ignored in general majority rules. To build consensus on pluralistic values and make social choices that consider minority opinions, we…

General Economics · Economics 2021-02-24 Takeshi Kato , Yasuhiro Asa , Misa Owa

In the theory of voting, the Plurality rule for preferences that come in the form of linear orders selects the alternatives most frequently appearing in the first position of those orders, while the Anti-Plurality rule selects the…

Computer Science and Game Theory · Computer Science 2026-05-21 Ulle Endriss , Federico Fioravanti

We present theoretical and empirical results demonstrating the usefulness of voting rules for participatory democracies. We first give algorithms which efficiently elicit \epsilon-approximations to two prominent voting rules: the Borda rule…

Multiagent Systems · Computer Science 2014-07-17 David Lee , Ashish Goel , Tanja Aitamurto , Helene Landemore

Combinatorial preference aggregation has many applications in AI. Given the exponential nature of these preferences, compact representations are needed and ($m$)CP-nets are among the most studied ones. Sequential and global voting are two…

Artificial Intelligence · Computer Science 2019-03-28 Thomas Lukasiewicz , Enrico Malizia

We study the problem of bribery in multiwinner elections, for the case where the voters cast approval ballots (i.e., sets of candidates they approve) and the bribery actions are limited to: adding an approval to a vote, deleting an approval…

Computer Science and Game Theory · Computer Science 2021-04-20 Piotr Faliszewski , Piotr Skowron , Nimrod Talmon

Approval-based committee (ABC) voting rules elect a fixed size subset of the candidates, a so-called committee, based on the voters' approval ballots over the candidates. While these rules have recently attracted significant attention,…

Computer Science and Game Theory · Computer Science 2023-02-24 Chris Dong , Patrick Lederer

Apportionment is the act of distributing the seats of a legislature among political parties (or states) in proportion to their vote shares (or populations). A famous impossibility by Balinski and Young (2001) shows that no apportionment…

Computer Science and Game Theory · Computer Science 2024-05-07 José Correa , Paul Gölz , Ulrike Schmidt-Kraepelin , Jamie Tucker-Foltz , Victor Verdugo

Social choice is replete with various settings including single-winner voting, multi-winner voting, probabilistic voting, multiple referenda, and public decision making. We study a general model of social choice called Sub-Committee Voting…

Computer Science and Game Theory · Computer Science 2017-11-17 Haris Aziz , Barton E. Lee

The proportional veto principle, which captures the idea that a candidate vetoed by a large group of voters should not be chosen, has been studied for ranked ballots in single-winner voting. We introduce a version of this principle for…

Computer Science and Game Theory · Computer Science 2025-05-05 Daniel Halpern , Ariel D. Procaccia , Warut Suksompong

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
‹ Prev 1 4 5 6 7 8 10 Next ›