English
Related papers

Related papers: Paradoxical Oddities in Two Multiwinner Elections …

200 papers

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

The Skating System, which originated from the scrutineering system in dance sport tournaments, can be formulated as a voting system: We introduce and formalize the Skating System Single (SkS, for short), a new voting system embedded into…

Computer Science and Game Theory · Computer Science 2025-12-01 Laryssa Horn , Paul Nüsken , Jörg Rothe , Tessa Seeger

Developing a better understanding of surprising or counterintuitive phenomena has constituted a significant portion of deep learning research in recent years. These include double descent, grokking, and the lottery ticket hypothesis --…

Machine Learning · Computer Science 2025-07-01 Alan Jeffares , Mihaela van der Schaar

In this paper we analyse some of the classical paradoxes in Social Choice Theory (namely, the Condorcet paradox, the discursive dilemma, the Ostrogorski paradox and the multiple election paradox) using a general framework for the study of…

Multiagent Systems · Computer Science 2014-06-12 Umberto Grandi

We experimentally study voter turnout in two-tier elections when the electorate consists of multiple groups, such as states. Votes are aggregated within the groups by the winner-take-all rule or the proportional rule, and the group-level…

General Economics · Economics 2024-08-19 Yoichi Hizen , Kazuya Kikuchi , Yukio Koriyama , Takehito Masuda

We consider one-dimensional excited random walks with finitely many cookies at each site. There are certain natural monotonicity results that are known for the excited random walk under some partial orderings of the cookie environments. We…

Probability · Mathematics 2016-06-14 Jonathon Peterson

Recently, we introduced in arXiv:1105.2434 a model for product adoption in social networks with multiple products, where the agents, influenced by their neighbours, can adopt one out of several alternatives. We identify and analyze here…

Computer Science and Game Theory · Computer Science 2013-05-29 Krzysztof R. Apt , Evangelos Markakis , Sunil Simon

There is a paradox in the model of social dynamics determined by voting in a stochastic environment (the ViSE model) called "pit of losses." It consists in the fact that a series of democratic decisions may systematically lead the society…

Multiagent Systems · Computer Science 2019-06-24 V. A. Malyshev , P. Yu. Chebotarev

In the context of voting with ranked ballots, an important class of voting rules is the class of margin-based rules (also called pairwise rules). A voting rule is margin-based if whenever two elections generate the same head-to-head margins…

Theoretical Economics · Economics 2026-03-11 Yifeng Ding , Wesley H. Holliday , Eric Pacuit

Despite many examples to the contrary, most models of elections assume that rules determining the winner will be followed. We present a model where elections are solely a public signal of the incumbent popularity, and citizens can protests…

Physics and Society · Physics 2013-02-04 Andrew T. Little , Joshua A. Tucker , Tom LaGatta

Shortlisting of candidates--selecting a group of "best" candidates--is a special case of multiwinner elections. We provide the first in-depth study of the computational complexity of strategic voting for shortlisting based on the perhaps…

Multiagent Systems · Computer Science 2019-08-15 Robert Bredereck , Andrzej Kaczmarczyk , Rolf Niedermeier

We present two collective games with new paradoxical features when they are combined. Besides reproducing the so--called Parrondo effect, where a winning game is obtained from the alternation of two fair games, a new effect appears, i.e.,…

Probability · Mathematics 2009-11-11 P. Amengual , P. Meurs , B. Cleuren , R. Toral

We study organizational elections in which each group nominates one candidate and receives as payoff its members expected utility under a probabilistic winning rule. We empirically justify a standard monotonicity assumption by simulating…

Computer Science and Game Theory · Computer Science 2026-02-06 Chuang-Chieh Lin , Chi-Jen Lu , Po-An Chen , Chih-Chieh Hung

Many real life situations require a set of items to be repeatedly placed in a random sequence. In such circumstances, it is often desirable to test whether such randomization indeed obtains, yet this problem has received very limited…

Applications · Statistics 2023-04-14 Darren Grant

Classical results in voting theory show that strategic manipulation by voters is inevitable if a voting rule simultaneously satisfy certain desirable properties. Motivated by this, we study the relevant question of how often a voting rule…

Computer Science and Game Theory · Computer Science 2015-02-17 Palash Dey , Y. Narahari

We study group decision-making in artificial societies where the rules of play are themselves subject to collective amendment. Using the self-amending game Nomic, we compare multiple scales across two LLM families and find that collective…

Adaptation and Self-Organizing Systems · Physics 2026-05-19 Kazuya Horibe , Masaomi Hatakeyama , Gen Masumoto , Takashi Hashimoto , Peter Romero

Elections, the cornerstone of democratic societies, are usually regarded as unpredictable due to the complex interactions that shape them at different levels. In this work, we show that voter turnouts contain crucial information that can be…

Physics and Society · Physics 2025-01-06 Ritam Pal , Aanjaneya Kumar , M. S. Santhanam

In a voting problem with a finite set of alternatives to choose from, we study the manipulation of tops-only rules. Since all non-dictatorial (onto) voting rules are manipulable when there are more than two alternatives and all preferences…

Theoretical Economics · Economics 2022-10-24 R. Pablo Arribillaga , Agustin G. Bonifacio

We study the complexity of deciding whether there is a tie in a given approval-based multiwinner election, as well as the complexity of counting tied winning committees. We consider a family of Thiele rules, their greedy variants,…

Computer Science and Game Theory · Computer Science 2023-05-04 Łukasz Janeczko , Piotr Faliszewski

A Condorcet voting scheme chooses a winning candidate as one who defeats all others in pairwise majority rule. We provide a review which includes the rigorous mathematical treatment for calculating the limiting probability of a Condorcet…

Statistics Theory · Mathematics 2007-06-13 M. S. Krishnamoorthy , M. Raghavachari