English
Related papers

Related papers: Power index rankings in bicameral legislatures and…

200 papers

We study a basic sequential model for the discovery of winning coalitions in a simple game, well known from its use in defining the Shapley-Shubik power index. We derive in a uniform way a family of measures of collective and individual…

Combinatorics · Mathematics 2013-07-30 Geoffrey Pritchard , Reyhaneh Reyhani , Mark C. Wilson

Parliaments dominated by two political blocs often face legislative inefficiencies as polarization increases. A central institutional question concerns how majority and supermajority rules interact with parliamentary composition to balance…

Physics and Society · Physics 2026-03-31 Gerardo Millar-Sáez , Ignacio Ormazábal , Hernán F. Astudillo

We present an alternative voting system that aims at bridging the gap between proportional representative systems and majoritarian, single winner election systems. The system lets people vote for multiple parties, but then assigns each…

Computer Science and Game Theory · Computer Science 2016-12-01 Pietro Speroni di Fenizio , Daniele A. Gewurz

Several power indices have been introduced in the literature in order to measure the influence of individual committee members on the aggregated decision. Here we ask the inverse question and aim to design voting rules for a committee such…

Computer Science and Game Theory · Computer Science 2016-01-22 Sascha Kurz

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

Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting…

Computer Science and Game Theory · Computer Science 2010-02-02 Haris Aziz , Mike Paterson

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

Weighted voting games are a well-known and useful class of succinctly representable simple games that have many real-world applications, e.g., to model collective decision-making in legislative bodies or shareholder voting. Among the…

Computer Science and Game Theory · Computer Science 2024-08-20 Joanna Kaczmarek , Jörg Rothe

The Shapley-Shubik index was designed to evaluate the power distribution in committee systems drawing binary decisions and is one of the most established power indices. It was generalized to decisions with more than two levels of approval…

Computer Science and Game Theory · Computer Science 2019-07-03 Sascha Kurz , Issofa Moyouwou , Hilaire Touyem

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

Classical power index analysis considers the individual's ability to influence the aggregated group decision by changing its own vote, where all decisions and votes are assumed to be binary. In many practical applications we have more…

Computer Science and Game Theory · Computer Science 2013-12-23 Sascha Kurz

Weighted voting is a classic model of cooperation among agents in decision-making domains. In such games, each player has a weight, and a coalition of players wins the game if its total weight meets or exceeds a given quota. A players power…

Computer Science and Game Theory · Computer Science 2014-01-17 Haris Aziz , Yoram Bachrach , Edith Elkind , Mike Paterson

In approval-based multiwinner voting, voters express approval preferences over a set of candidates, and the goal is to return a winning committee. This model captures a broad range of subset selection problems under preferences. Prior work…

Computer Science and Game Theory · Computer Science 2026-04-28 Niclas Boehmer , Luca Kreisel , Jannik Peters

The Penrose-Banzhaf index and the Shapley-Shubik index are the best-known and the most used tools to measure political power of voters in simple voting games. Most methods to calculate these power indices are based on counting winning…

Combinatorics · Mathematics 2009-03-16 Werner Kirsch , Jessica Langner

Power indices are essential in assessing the contribution and influence of individual agents in multi-agent systems, providing crucial insights into collaborative dynamics and decision-making processes. While invaluable, traditional…

Multiagent Systems · Computer Science 2025-03-12 Benjamin Kempinski , Tal Kachman

Every representative democracy must specify a mechanism under which voters choose their representatives. The most common mechanism in the United States -- Winner takes all single-member districts -- both enables substantial partisan…

Computer Science and Game Theory · Computer Science 2026-02-23 Nikhil Garg , Wes Gurnee , David Rothschild , David Shmoys

In this paper, I characterize minimal stable voting rules and minimal self-stable constitutions (i.e., pairs of voting rules) for societies in which only power matters. To do so, I first let players' preference profiles over voting rules…

Theoretical Economics · Economics 2025-08-26 Héctor Hermida-Rivera

Election rules are formal processes that aggregate voters preferences, typically to select a single candidate, called the winner. Most of the election rules studied in the literature require the voters to rank the candidates from the most…

Data Structures and Algorithms · Computer Science 2019-01-31 Matthias Bentert , Piotr Skowron

In coalitional games, a player $i$ is regarded as strictly more desirable than player $j$ if substituting $j$ with $i$ within any coalition leads to a strict augmentation in the value of certain coalitions, while preserving the value of the…

Computer Science and Game Theory · Computer Science 2024-04-30 Michele Aleandri , Felix Fritz , Stefano Moretti

Political actors often manipulate redistricting plans to gain electoral advantages, a process known as gerrymandering. Several states have implemented institutional reforms to address this problem, such as establishing map-drawing…

Applications · Statistics 2025-08-12 Cory McCartan , Christopher T. Kenny , Tyler Simko , Emma Ebowe , Michael Y. Zhao , Kosuke Imai