English
Related papers

Related papers: On the inverse power index problem

200 papers

False-name manipulation refers to the question of whether a player in a weighted voting game can increase her power by splitting into several players and distributing her weight among these false identities. Analogously to this splitting…

Computer Science and Game Theory · Computer Science 2021-07-30 Anja Rey , Jörg Rothe

A committee's decisions on more than two alternatives much depend on the adopted voting method, and so does the distribution of power among the committee members. We investigate how different aggregation methods such as plurality runoff,…

Computer Science and Game Theory · Computer Science 2021-02-15 Sascha Kurz , Alexander Mayer , Stefan Napel

Binary yes-no decisions in a legislative committee or a shareholder meeting are commonly modeled as a weighted game. However, there are noteworthy exceptions. E.g., the voting rules of the European Council according to the Treaty of Lisbon…

Computer Science and Game Theory · Computer Science 2021-08-11 Sascha Kurz

A number of recent works [Goldberg 2006; O'Donnell and Servedio 2011; De, Diakonikolas, and Servedio 2017; De, Diakonikolas, Feldman, and Servedio 2014] have considered the problem of approximately reconstructing an unknown weighted voting…

Computer Science and Game Theory · Computer Science 2020-07-28 Huck Bennett , Anindya De , Rocco A. Servedio , Emmanouil-Vasileios Vlatakis-Gkaragkounis

In social network analysis, there is a common perception that influence is relevant to determine the global behavior of the society and thus it can be used to enforce cooperation by targeting an adequate initial set of individuals or to…

Computer Science and Game Theory · Computer Science 2013-07-01 Xavier Molinero , Fabián Riquelme , Maria Serna

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

The Shapley-Shubik power index is a measure of each voters power in the passage or failure of a vote. We extend this measure to graphs and consider a discrete-time process in which voters may change their vote based on the outcome of the…

Discrete Mathematics · Computer Science 2020-07-13 Jordan Barrett , Christopher Duffy , Richard Nowakowski

In this paper new algorithm for calculating power indices is described. The complexity class of the problem is #P-complete and even calculating power index of the biggest player is NP-hard task. Constructed algorithm is a mix of ideas of…

Computer Science and Game Theory · Computer Science 2011-01-25 Bartosz Meglicki

Given a system where the real-valued states of the agents are aggregated by a function to a real-valued state of the entire system, we are interested in the influence or importance of the different agents for that function. This generalizes…

Computer Science and Game Theory · Computer Science 2018-11-20 Sascha Kurz

This paper examines an area of Game Theory called Voting Power Theory. With the adoption of a measure theoretic framework it argues that the many different indices and tools currently used for measuring voting power can be replaced by just…

Statistics Theory · Mathematics 2012-01-24 Sreejith Das , Iead Rezek

Important decisions are likely made by groups of agents. Thus group decision making is very common in practice. Very transparent group aggregating rules are given by weighted voting, where each agent is assigned a weight. Here a proposal is…

Combinatorics · Mathematics 2014-01-08 Sascha Kurz , Nikolas Tautenhahn

Based on Holler (1982) and Armijos-Toro et al. (2021) we propose two power indices to measure the influence of the players in the class of weighted majority games in partition function form. We compare these new power indices with their…

Computer Science and Game Theory · Computer Science 2024-02-12 José M. Alonso-Meijide , Livino M. Armijos-Toro , Balbina V. Casas-Méndez , Manuel A. Mosquera

It is well known that the Penrose-Banzhaf index of a weighted game can differ starkly from corresponding weights. Limit results are quite the opposite, i.e., under certain conditions the power distribution approaches the weight…

Computer Science and Game Theory · Computer Science 2019-10-23 Sascha Kurz

This paper employs switching-algebraic techniques for the calculation of a fundamental index of voting powers, namely, the total Banzhaf power. This calculation involves two distinct operations: (a) Boolean differencing or differentiation,…

Logic in Computer Science · Computer Science 2023-06-14 Ali Muhammad Rushdi , Muhammad Ali Rushdi

Consider an election between two candidates in which the voters' choices are random and independent and the probability of a voter choosing the first candidate is $p>1/2$. Condorcet's Jury Theorem which he derived from the weak law of large…

Probability · Mathematics 2007-05-23 Olle Haggstrom , Gil Kalai , Elchanan Mossel

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

Although manipulation and bribery have been extensively studied under weighted voting, there has been almost no work done on election control under weighted voting. This is unfortunate, since weighted voting appears in many important…

Computer Science and Game Theory · Computer Science 2013-05-07 Piotr Faliszewski , Edith Hemaspaandra , Lane A. Hemaspaandra

The International Monetary Fund is one of the largest international organizations using a weighted voting system. The weights of its 188 members are determined by a fixed amount of basic votes plus some extra votes for so-called Special…

Computer Science and Game Theory · Computer Science 2016-03-07 Sascha Kurz

Voting power determines the "power" of individuals who cast votes; their power is based on their ability to influence the winning-ness of a coalition. Usually each individual acts alone, casting either all or none of their votes and is…

Computer Science and Game Theory · Computer Science 2013-12-13 Daniel Zwillinger

We explore the switching-algebraic computation of the Banzhaf indices for general and monotone or unrestricted systems. This computation is achieved via (a) two Boolean-quotient formulas that are valid when the voting system is not…

Computer Science and Game Theory · Computer Science 2023-06-27 Ali Muhammad Rushdi , Muhammad Ali Rushdi