English
Related papers

Related papers: A Law of Large Numbers for Weighted Majority

200 papers

We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning…

Computer Science and Game Theory · Computer Science 2017-11-20 Piotr Faliszewski , Arkadii Slinko , Nimrod Talmon

Weighted voting games are frequently used in decision making. Each voter has a weight and a proposal is accepted if the weight sum of the supporting voters exceeds a quota. One line of research is the efficient computation of so-called…

Optimization and Control · Mathematics 2012-11-28 Sascha Kurz

This paper proposes normative criteria for voting rules under uncertainty about individual preferences. The criteria emphasize the importance of responsiveness, i.e., the probability that the social outcome coincides with the realized…

Theoretical Economics · Economics 2025-07-31 Satoshi Nakada , Shmuel Nitzan , Takashi Ui

Like many other voting systems, Majority Judgement suffers from the weaknesses of the underlying mathematical model: Elections as problem of choice or ranking. We show how the model can be enhanced to take into account the complete process…

Computer Science and Game Theory · Computer Science 2023-07-07 Friedemann Kemm

The Possible-Winner problem asks, given an election where the voters' preferences over the set of candidates is partially specified, whether a distinguished candidate can become a winner. In this work, we consider the computational…

Computer Science and Game Theory · Computer Science 2018-02-27 Batya Kenig

There are many factors that can influence the outcome of an election. We here identify two dominant effects that can affect the votes obtained by a candidate, namely, the Majority Effect and the Media Effect. We mimic these two effects in a…

Physics and Society · Physics 2009-11-10 Chung-I Chou , Sai-Ping Li

A cornerstone of social choice theory is Condorcet's paradox which says that in an election where $n$ voters rank $m$ candidates it is possible that, no matter which candidate is declared the winner, a majority of voters would have…

Computer Science and Game Theory · Computer Science 2025-04-23 Moses Charikar , Alexandra Lassota , Prasanna Ramakrishnan , Adrian Vetta , Kangning Wang

We propose a simple method for combining together voting rules that performs a run-off between the different winners of each voting rule. We prove that this combinator has several good properties. For instance, even if just one of the base…

Artificial Intelligence · Computer Science 2012-03-15 Nina Narodytska , Toby Walsh , Lirong Xia

Voters from m disjoint constituencies (regions, federal states, etc.) are represented in an assembly which contains one delegate from each constituency and applies a weighted voting rule. All agents are assumed to have single-peaked…

Computer Science and Game Theory · Computer Science 2012-11-28 Sascha Kurz , Nicola Maaser , Stefan Napel

Systems of indirect voting based on the principle of qualified majority can be analysed using the methods of game theory. In particular, this applies to the voting system in the Council of the European Union, which was recently a subject of…

Physics and Society · Physics 2007-05-23 Wojciech Slomczynski , Karol Zyczkowski

There is a class of models for pol/mil/econ bargaining and conflict that is loosely based on the Median Voter Theorem which has been used with great success for about 30 years. However, there are fundamental mathematical limitations to…

Computer Science and Game Theory · Computer Science 2015-05-12 Ben Wise , Steven Bankes

In social choice theory with ordinal preferences, a voting method satisfies the axiom of positive involvement if adding to a preference profile a voter who ranks an alternative uniquely first cannot cause that alternative to go from winning…

Theoretical Economics · Economics 2025-04-01 Wesley H. Holliday

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

Voting is the aggregation of individual preferences in order to select a winning alternative. Selection of a winner is accomplished via a voting rule, e.g., rank-order voting, majority rule, plurality rule, approval voting. Which voting…

Theoretical Economics · Economics 2020-05-18 Anne Carlstein

We study the Shapley value in weighted voting games. The Shapley value has been used as an index for measuring the power of individual agents in decision-making bodies and political organizations, where decisions are made by a majority vote…

Computer Science and Game Theory · Computer Science 2014-08-05 Joel Oren , Yuval Filmus , Yair Zick , Yoram Bachrach

Despite extensive theoretical research on proportionality in approval-based multiwinner voting, its impact on which committees and candidates can be selected in practice remains poorly understood. We address this gap by (i) analyzing the…

Computer Science and Game Theory · Computer Science 2025-11-13 Niclas Boehmer , Lara Glessen , Jannik Peters

Voting systems typically treat all voters equally. We argue that perhaps they should not: Voters who have supported good choices in the past should be given higher weight than voters who have supported bad ones. To develop a formal…

Computer Science and Game Theory · Computer Science 2017-03-16 Nika Haghtalab , Ritesh Noothigattu , Ariel D. Procaccia

Weighted voting games apply to a wide variety of multi-agent settings. They enable the formalization of power indices which quantify the coalitional power of players. We take a novel approach to the study of the power of big vs.~small…

Computer Science and Game Theory · Computer Science 2021-09-28 Yotam Gafni , Ron Lavi , Moshe Tennenholtz

We consider voting on multiple independent binary issues. In addition, a weighting vector for each voter defines how important they consider each issue. The most natural way to aggregate the votes into a single unified proposal is…

Computer Science and Game Theory · Computer Science 2025-02-21 Carmel Baharav , Andrei Constantinescu , Roger Wattenhofer

We study voting rules with respect to how they allow or limit a majority from dominating minorities: whether a voting rule makes a majority powerful, and whether minorities can veto the candidates they do not prefer. For a given voting…

Computer Science and Game Theory · Computer Science 2022-09-09 Aleksei Y. Kondratev , Alexander S. Nesterov