The Banzhaf power index for ternary bicooperative games
نویسندگان
چکیده
In this paper we analyze ternary bicooperative games, which are a refinement of the concept of a ternary voting game introduced by Felsenthal and Machover. Furthermore, majority voting rules based on the difference of votes are simple bicooperative games. First, we define the concepts of the defender and detractor swings for a player. Next, we introduce the Banzhaf power index and the normalized Banzhaf power index. The main result of the paper is an axiomatization of the Banzhaf power index for the class of ternary bicooperative games. Moreover, we study ternary bicooperative games with two lists of weights and compute the Banzhaf power index using generating functions. © 2010 Elsevier B.V. All rights reserved.
منابع مشابه
Voting Power in the Council of the European Union under the Nice rules
We provide a new method to compute the Banzhaf power index for weighted voting games as well as weighted double and triple majority games. We calculate the Banzhaf index in an exact way by generating functions, with a signi...cant decrease in the computational complexity. Moreover, the Banzhaf indices are calculated for the decision rules approved in the Nice summit meeting, which will be used ...
متن کاملA heuristic approximation method for the Banzhaf index for voting games
The Banzhaf index is a well known and widely used index for measuring the power a player has in a voting game. However, the problem of computing this index is computationally hard. To overcome this problem, a number of approximation methods were developed for one majority voting games. While it may be possible to extend some of these to k-majority games (which are generalized versions of one ma...
متن کاملVoting Power in the European Union Council under the Nice rules
The purpose of this paper is to compute the Banzhaf power index for weighted voting games as well as weighted double and triple majority games. We calculate the Banzhaf index in an exact way by generating functions, with a signi...cant decrease of the computational complexity. Moreover, the Banzhaf indices are calculated for the decision rules approved in the Nice summit meeting, which will be ...
متن کاملSpanning connectivity games
The Banzhaf index, Shapley-Shubik index and other voting power indices measure the importance of a player in a coalitional game. We consider a simple coalitional game called the spanning connectivity game (SCG) based on an undirected, unweighted multigraph, where edges are players. We examine the computational complexity of computing the voting power indices of edges in the SCG. It is shown tha...
متن کاملThe Complexity of Power-Index Comparison
We study the complexity of the following problem: Given two weighted voting games G′ and G′′ that each contain a player p, in which of these games is p’s power index value higher? We study this problem with respect to both the Shapley-Shubik power index [SS54] and the Banzhaf power index [Ban65, DS79]. Our main result is that for both of these power indices the problem is complete for probabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 158 شماره
صفحات -
تاریخ انتشار 2010