English
Related papers

Related papers: What Do We Elect Committees For? A Voting Committe…

200 papers

Consideration was given to a model of social dynamics controlled by successive collective decisions based on the threshold majority procedures. The current system state is characterized by the vector of participants' capitals (utilities).…

Optimization and Control · Mathematics 2009-02-27 V. I. Borzenko , Z. M. Lezina , A. K. Loginov , Ya. Yu. Tsodikova , P. Yu. Chebotarev

The integrity of elections is central to democratic systems. However, a myriad of malicious actors aspire to influence election outcomes for financial or political benefit. A common means to such ends is by manipulating perceptions of the…

Computer Science and Game Theory · Computer Science 2022-06-22 Junlin Wu , Andrew Estornell , Lecheng Kong , Yevgeniy Vorobeychik

We investigate how robust approval-based multiwinner voting rules are to small perturbations in the votes. In particular, we consider the extent to which a committee can change after we add/remove/swap one approval, and we consider the…

Computer Science and Game Theory · Computer Science 2026-01-28 Piotr Faliszewski , Grzegorz Gawron , Bartosz Kusek

Citizens' assemblies are a form of democratic innovation in which a randomly selected panel of constituents deliberates on questions of public interest. We study a novel goal for the selection of panel members: maximizing the entropy of the…

Computer Science and Game Theory · Computer Science 2026-04-06 Gabriel de Azevedo , Paul Gölz

We consider the following problem in which a given number of items has to be chosen from a predefined set. Each item is described by a vector of attributes and for each attribute there is a desired distribution that the selected set should…

Artificial Intelligence · Computer Science 2021-03-29 Jerome Lang , Piotr Skowron

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

We design two mechanisms that ensure that the majority preferred option wins in all equilibria. The first one is a simultaneous game where agents choose other agents to cooperate with on top of the vote for an alternative, thus overcoming…

Theoretical Economics · Economics 2023-10-12 Kirneva Margarita , Núñez Matías

In approval-based committee (ABC) voting, the goal is to choose a subset of predefined size of the candidates based on the voters' approval preferences over the candidates. While this problem has attracted significant attention in recent…

Computer Science and Game Theory · Computer Science 2023-12-15 Martin Bullinger , Chris Dong , Patrick Lederer , Clara Mehler

The traditional election control problem focuses on the use of control to promote a single candidate. In parliamentary elections, however, the focus shifts: voters care no less about the overall governing coalition than the individual…

Computer Science and Game Theory · Computer Science 2025-03-07 Hodaya Barr , Eden Hartman , Yonatan Aumann , Sarit Kraus

This paper is an axiomatic study of consistent approval-based multi-winner rules, i.e., voting rules that select a fixed-size group of candidates based on approval ballots. We introduce the class of counting rules and provide an axiomatic…

Computer Science and Game Theory · Computer Science 2019-11-13 Martin Lackner , Piotr Skowron

We consider distributed elections, where there is a center and $k$ sites. In such distributed elections, each voter has preferences over some set of candidates, and each voter is assigned to exactly one site such that each site is aware…

Computer Science and Game Theory · Computer Science 2019-07-24 Arnold Filtser , Nimrod Talmon

This article aims to present a unified framework for grading-based voting processes. The idea is to represent the grades of each voter on d candidates as a point in R^d and to define the winner of the vote using the deepest point of the…

Other Statistics · Statistics 2021-12-21 Jean-Baptiste Aubin , Irène Gannaz , Samuela Leoni-Aubin , Antoine Rolland

Justified representation (JR) is a standard notion of representation in multiwinner approval voting. Not only does a JR committee always exist, but previous work has also shown through experiments that the JR condition can typically be…

Computer Science and Game Theory · Computer Science 2023-06-29 Edith Elkind , Piotr Faliszewski , Ayumi Igarashi , Pasin Manurangsi , Ulrike Schmidt-Kraepelin , Warut Suksompong

In the apportionment problem, a fixed number of seats must be distributed among parties in proportion to the number of voters supporting each party. We study a generalization of this setting, in which voters can support multiple parties by…

Computer Science and Game Theory · Computer Science 2022-03-31 Markus Brill , Paul Gölz , Dominik Peters , Ulrike Schmidt-Kraepelin , Kai Wilker

Approval voting is widely used for making multi-winner voting decisions. The canonical rule (also called Approval Voting) used in the setting aims to maximize social welfare by selecting candidates with the highest number of approvals. We…

Computer Science and Game Theory · Computer Science 2026-04-21 Haris Aziz , Yuhang Guo , Venkateswara Rao Kagita , Baharak Rastegari , Mashbat Suzuki

We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates and a single candidate is selected. Prior work has adapted popular notions of…

Computer Science and Game Theory · Computer Science 2025-02-11 Edith Elkind , Svetlana Obraztsova , Jannik Peters , Nicholas Teh

Elections and opinion polls often have many candidates, with the aim to either rank the candidates or identify a small set of winners according to voters' preferences. In practice, voters do not provide a full ranking; instead, each voter…

Computer Science and Game Theory · Computer Science 2019-08-16 Nikhil Garg , Lodewijk Gelauff , Sukolsak Sakshuwong , Ashish Goel

We consider the problem of electing a committee of $k$ candidates, subject to some constraints as to what this committee is supposed to look like. In our framework, the candidates are given labels as an abstraction of a politician's…

Computer Science and Game Theory · Computer Science 2020-05-19 Egor Ianovski

Citizens' assemblies are an increasingly influential form of deliberative democracy, where randomly selected people discuss policy questions. The legitimacy of these assemblies hinges on their representation of the broader population, but…

Machine Learning · Computer Science 2025-08-13 Angelos Assos , Carmel Baharav , Bailey Flanigan , Ariel Procaccia

Many democratic societies use district-based elections, where the region under consideration is geographically divided into districts and a representative is chosen for each district based on the preferences of the electors who reside…

Computers and Society · Computer Science 2022-03-09 Adway Mitra