English
Related papers

Related papers: Instant Runoff Voting and the Reinforcement Parado…

200 papers

Limited Voting (LV) is an approval-based method for multi-winner elections where all ballots are required to have a same fixed size. While it appears to be used as voting method in corporate governance and has some political applications,…

Computer Science and Game Theory · Computer Science 2024-07-26 Maaike Venema-Los , Zoé Christoff , Davide Grossi

Multiwinner voting captures a wide variety of settings, from parliamentary elections in democratic systems to product placement in online shopping platforms. There is a large body of work dealing with axiomatic characterizations,…

Computer Science and Game Theory · Computer Science 2023-12-12 Edith Elkind , Svetlana Obraztsova , Nicholas Teh

Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some voters to vote who would otherwise not attend the election. Traditionally, voters…

Multiagent Systems · Computer Science 2014-06-27 Laurent Bulteau , Jiehua Chen , Piotr Faliszewski , Rolf Niedermeier , Nimrod Talmon

We consider one-round games between a classical verifier and two provers. One of the main questions in this area is the \emph{parallel repetition question}: If the game is played $\ell$ times in parallel, does the maximum winning…

Quantum Physics · Physics 2009-11-03 Julia Kempe , Oded Regev

A local bootstrap method is proposed for the analysis of electoral vote-count first-digit frequencies, complementing the Benford's Law limit. The method is calibrated on five presidential-election first rounds (2002--2006) and applied to…

Applications · Statistics 2015-03-13 Boudewijn F. Roukema

In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the remaining voters are truthful. In this paper, we depart from…

Computer Science and Game Theory · Computer Science 2010-01-28 Yvo Desmedt , Edith Elkind

We study the mixing time of a non-Markovian process, the step-reinforced random walk (SRRW) on a finite group. This process differs from a classical random walk in that at each integer time, with probability $\alpha$ the next step is chosen…

Probability · Mathematics 2026-04-29 Yuval Peres , Shuo Qin

Justified representation (JR) and extended justified representation (EJR) are well-established proportionality axioms in approval-based multiwinner voting. Both axioms are always satisfiable, but they rely on a fixed quota (typically Hare…

Computer Science and Game Theory · Computer Science 2026-02-18 Patrick Becker , Fabian Frank

Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party (an attacker) attempts to manipulate the election outcome in…

Computer Science and Game Theory · Computer Science 2019-06-18 Edith Elkind , Jiarui Gan , Svetlana Obraztsova , Zinovi Rabinovich , Alexandros A. Voudouris

Elections repeat commonly after a fixed time interval, ranging from months to years. This results in limitations on governance since elected candidates or policies are difficult to remove before the next elections, if needed, and allowed by…

Cryptography and Security · Computer Science 2023-09-26 Sarad Venugopalan , Ivana Stančíková , Ivan Homoliak

Consider the following game: You are given two indistinguishable envelopes, each containing money. One contains twice as much as the other. You may pick one envelope and keep the money it contains. Having chosen an envelope, you are given…

Probability · Mathematics 2021-01-29 Nemo Semret

A popular perspective in Reinforcement learning (RL) casts the problem as probabilistic inference on a graphical model of the Markov decision process (MDP). The core object of study is the probability of each state-action pair being visited…

Machine Learning · Computer Science 2023-11-23 Jean Tarbouriech , Tor Lattimore , Brendan O'Donoghue

In the United States electoral system, a candidate is elected indirectly by winning a majority of electoral votes cast by individual states, the election usually being decided by the votes cast by a small number of "swing states" where the…

Physics and Society · Physics 2012-11-06 G. C. Levine , B. Caravan , J. E. Cerise

It is well known, by the Gibbard-Satterthwaite Theorem, that when there are more than two candidates, any non-dictatorial voting rule can be manipulated by untruthful voters. But how strong is the incentive to manipulate under different…

Computer Science and Game Theory · Computer Science 2026-02-27 Ratip Emin Berker , Vincent Conitzer , Eden Hartman , Jiayuan Liu , Caspar Oesterheld

The aim of this paper is to study the asymptotic behavior of strongly reinforced interacting urns with partial memory sharing. The reinforcement mechanism considered is as follows: draw at each step and for each urn a white or black ball…

Probability · Mathematics 2012-01-10 Mickaël Launay

Parrondo paradox describes the counterintuitive phenomenon in which alternating two individually losing games yields a winning outcome. Extending this effect to the quantum regime has typically required high dimensional coin spaces,…

Quantum Physics · Physics 2026-04-15 Jen-Yu Chang , Yun-Hsuan Chen , Gooi Zi Liang , Chih-Yu Chen , Tsung-Wei Huang

STV and ranked pairs (RP) are two well-studied voting rules for group decision-making. They proceed in multiple rounds, and are affected by how ties are broken in each round. However, the literature is surprisingly vague about how ties…

Artificial Intelligence · Computer Science 2019-01-29 Jun Wang , Sujoy Sikdar , Tyler Shepherd , Zhibing Zhao , Chunheng Jiang , Lirong Xia

When selecting multiple candidates based on approval preferences of agents, the proportional representation of agents' opinions is an important and well-studied desideratum. Existing criteria for evaluating the representativeness of…

Computer Science and Game Theory · Computer Science 2024-10-02 Markus Brill , Jonas Israel , Evi Micha , Jannik Peters

A core tension in the study of plurality elections is the clash between the classic Hotelling-Downs model, which predicts that two office-seeking candidates should position themselves at the median voter's policy, and the empirical…

Computer Science and Game Theory · Computer Science 2025-03-04 Kiran Tomlinson , Tanvi Namjoshi , Johan Ugander , Jon Kleinberg

We study the phenomenon of intransitivity in models of dice and voting. First, we follow a recent thread of research for $n$-sided dice with pairwise ordering induced by the probability, relative to $1/2$, that a throw from one die is…

Probability · Mathematics 2020-10-27 Jan Hązła , Elchanan Mossel , Nathan Ross , Guangqu Zheng
‹ Prev 1 4 5 6 7 8 10 Next ›