English
Related papers

Related papers: Worst-case Bounds on Power vs. Proportion in Weigh…

200 papers

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

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

An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational complexity of false-name manipulation in weighted voting games…

Computer Science and Game Theory · Computer Science 2009-05-21 Haris Aziz , Mike Paterson

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

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

Weighted voting games are a family of cooperative games, typically used to model voting situations where a number of agents (players) vote against or for a proposal. In such games, a proposal is accepted if an appropriately weighted sum of…

Computer Science and Game Theory · Computer Science 2019-01-01 Ilias Diakonikolas , Chrystalla Pavlou

Coalitional voting games appear in different forms in multi-agent systems, social choice and threshold logic. In this paper, the complexity of comparison of influence between players in coalitional voting games is characterized. The…

Computer Science and Game Theory · Computer Science 2008-09-04 Haris Aziz

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 a popular class of coalitional games that are widely used to model real-life situations of decision-making. They can be applied, for instance, to analyze legislative processes in parliaments or voting in corporate…

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

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 investigate the distribution of the well-studied Shapley--Shubik values in weighted voting games where the agents are stochastically determined. The Shapley--Shubik value measures the voting power of an agent, in typical collective…

Computer Science and Game Theory · Computer Science 2016-01-26 Yuval Filmus , Joel Oren , Kannan Soundararajan

Decisions in a shareholder meeting or a legislative committee are often modeled as a weighted game. Influence of a member is then measured by a power index. A large variety of different indices has been introduced in the literature. This…

Computer Science and Game Theory · Computer Science 2018-05-08 Sascha Kurz

This paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with minimum and the number of weighted games for the dual class…

Combinatorics · Mathematics 2015-05-14 Josep Freixas , Sascha Kurz

We investigate a class of weighted voting games for which weights are randomly distributed over the standard probability simplex. We provide close-formed formulae for the expectation and density of the distribution of weight of the $k$-th…

Computer Science and Game Theory · Computer Science 2022-02-11 Daria Boratyn , Werner Kirsch , Wojciech Słomczyński , Dariusz Stolicki , Karol Życzkowski

We use simplicial complexes to model simple games as well as weighted voting games where certain coalitions are considered impossible. Topological characterizations of various ideas from simple games are provided, as are the expressions for…

Physics and Society · Physics 2025-08-29 Anastasia Brooks , Franjo Sarcevic , Ismar Volic

In this paper, we propose fast pseudo-polynomial-time algorithms for computing power indices in weighted majority games. We show that we can compute the Banzhaf index for all players in $O(n+q\log (q))$ time, where $n$ is the number of…

Computer Science and Game Theory · Computer Science 2025-11-20 Naonori Kakimura , Yoshihiko Terai

Following Zhang and Grossi~(AAAI 2021), we study in more depth a variant of weighted voting games in which agents' weights are induced by a transitive support structure. This class of simple games is notably well suited to study the…

Computer Science and Game Theory · Computer Science 2022-01-25 Gianlorenzo D'Angelo , Esmaeil Delfaraz , Hugo Gilbert

The Banzhaf power index was introduced in cooperative game theory to measure the real power of players in a game. The Banzhaf interaction index was then proposed to measure the interaction degree inside coalitions of players. It was shown…

Optimization and Control · Mathematics 2011-02-15 Jean-Luc Marichal , Pierre Mathonet

We introduce new power indices to measure the a priori voting power of voters in liquid democracy elections where an underlying network restricts delegations. We argue that our power indices are natural extensions of the standard…

Multiagent Systems · Computer Science 2023-05-16 Rachael Colley , Théo Delemazure , Hugo Gilbert

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
‹ Prev 1 2 3 10 Next ›