English
Related papers

Related papers: Phragm\'{e}n's Voting Methods and Justified Repres…

200 papers

We study electoral campaign management scenarios in which an external party can buy votes, i.e., pay the voters to promote its preferred candidate in their preference rankings. The external party's goal is to make its preferred candidate a…

Computer Science and Game Theory · Computer Science 2010-11-29 Edith Elkind , Piotr Faliszewski

Even though proportional representation is a fundamental goal in multiwinner voting and a plethora of proportionality notions has been introduced, the normative justifications for choosing one notion over another remain poorly understood.…

Computer Science and Game Theory · Computer Science 2026-05-07 Chris Dong , Jannik Peters

We propose a new single-winner election method ("Schulze method") and prove that it satisfies many academic criteria (e.g. monotonicity, reversal symmetry, resolvability, independence of clones, Condorcet criterion, k-consistency,…

Computer Science and Game Theory · Computer Science 2025-10-28 Markus Schulze

The stochastic composition optimization proposed recently by Wang et al. [2014] minimizes the objective with the compositional expectation form: $\min_x~(\mathbb{E}_iF_i \circ \mathbb{E}_j G_j)(x).$ It summarizes many important applications…

Optimization and Control · Mathematics 2017-05-23 Xiangru Lian , Mengdi Wang , Ji Liu

Ranked-choice voting anomalies such as monotonicity paradoxes have been extensively studied through creating hypothetical examples and generating elections under various models of voter behavior. However, very few real-world examples of…

General Economics · Economics 2024-11-20 Adam Graham-Squire , David McCune

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

We present a constraint-based morphological disambiguation system in which individual constraints vote on matching morphological parses, and disambiguation of all the tokens in a sentence is performed at the end by selecting parses that…

cmp-lg · Computer Science 2016-08-31 Kemal Oflazer , Gokhan Tur

Multi-winner voting plays a crucial role in selecting representative committees based on voter preferences. Previous research has predominantly focused on single-stage voting rules, which are susceptible to manipulation during preference…

Computer Science and Game Theory · Computer Science 2024-02-06 Shengjie Gong , Lingxiao Huang , Shuangping Huang , Yuyi Wang , Zhiqi Wang , Tao Xiao , Xiang Yan , Chunxue Yang

By classic results in social choice theory, any reasonable preferential voting method sometimes gives individuals an incentive to report an insincere preference. The extent to which different voting methods are more or less resistant to…

Artificial Intelligence · Computer Science 2025-02-25 Wesley H. Holliday , Alexander Kristoffersen , Eric Pacuit

Given $n$ colored balls, we want to detect if more than $\lfloor n/2\rfloor$ of them have the same color, and if so find one ball with such majority color. We are only allowed to choose two balls and compare their colors, and the goal is to…

Data Structures and Algorithms · Computer Science 2016-05-02 Paweł Gawrychowski , Jukka Suomela , Przemysław Uznański

We establish a link between multiwinner elections and apportionment problems by showing how approval-based multiwinner election rules can be interpreted as methods of apportionment. We consider several multiwinner rules and observe that…

Computer Science and Game Theory · Computer Science 2021-04-21 Markus Brill , Jean-François Laslier , Piotr Skowron

We propose a new method to accelerate the convergence of optimization algorithms. This method simply adds a power coefficient $\gamma\in[0,1)$ to the gradient during optimization. We call this the Powerball method and analyze the…

Systems and Control · Computer Science 2019-09-24 Ye Yuan , Mu Li , Jun Liu , Claire J. Tomlin

In multiwinner approval elections with many candidates, voters may struggle to determine their preferences over the entire slate of candidates. It is therefore of interest to explore which (if any) fairness guarantees can be provided under…

Computer Science and Game Theory · Computer Science 2025-10-14 Drew Springham , Edith Elkind , Bart de Keijzer , Maria Polukarov

We provide a relatively simple proof that the expected gap between the maximum load and the average load in the two choice process is bounded by $(1+o(1))\log \log n$, irrespective of the number of balls thrown. The theorem was first proven…

Discrete Mathematics · Computer Science 2013-10-22 Kunal Talwar , Udi Wieder

Variational inequalities are a universal optimization paradigm that is interesting in itself, but also incorporates classical minimization and saddle point problems. Modern realities encourage to consider stochastic formulations of…

Optimization and Control · Mathematics 2024-03-27 Alexander Pichugin , Maksim Pechin , Aleksandr Beznosikov , Alexander Gasnikov

We exhibit the hidden beauty of weighted voting and voting power by applying a generalization of the Penrose-Banzhaf index to social choice rules. Three players who have multiple votes in a committee decide between three options by…

Computer Science and Game Theory · Computer Science 2022-08-01 Sascha Kurz , Alexander Mayer , Stefan Napel

As the world's democratic institutions are challenged by dissatisfied citizens, political scientists and also computer scientists have proposed and analyzed various (innovative) methods to select representative bodies, a crucial task in…

Multiagent Systems · Computer Science 2023-04-07 Manon Revel , Niclas Boehmer , Rachael Colley , Markus Brill , Piotr Faliszewski , Edith Elkind

Elections are the central institution of democratic processes, and often the elected body -- in either public or private governance -- is a committee of individuals. To ensure the legitimacy of elected bodies, the electoral processes should…

Computers and Society · Computer Science 2022-06-01 Florian Evéquoz , Johan Rochel , Vijay Keswani , L. Elisa Celis

Recent works have studied the design of algorithms for selecting representative sortition panels. However, the most central question remains unaddressed: Do these panels reflect the entire population's opinion? We present a positive answer…

Computer Science and Game Theory · Computer Science 2024-06-05 Ioannis Caragiannis , Evi Micha , Jannik Peters

We study the problem of selecting a representative committee of $k$ agents from a collection of $n$ agents in a common metric space. This problem is related to choosing $k$ facilities in facility location and $k$-median problems. However,…

Computer Science and Game Theory · Computer Science 2025-10-27 Christopher Jerrett , Elliot Anshelevich