Power Indices and Minimal Winning Coalitions for Simple Games in Partition Function Form

We propose a generalization of simple games to partition function form games based on a monotonicity property that we define in this context. This property allows us to properly speak about minimal winning embedded coalitions. We propose and characterize two power indices based on such coalitions. Finally, the new indices are used to study the distribution of power in the Parliament of Andalusia that emerged after the elections of March 22, 2015.


Introduction
Game theory provides valuable tools to study how power is distributed among the members of a decision making body. Most of the literature identifies the power of an agent with her ability to change the outcome of a ballot. The Shapley-Shubik index (Shapley and Shubik 1954) is probably the most well known and widely accepted way to measure power. However, many different power indices have been proposed in the literature so far. The Banzhaf index (Banzhaf 1964) (Weber 1988) based on marginal contributions of an agent to coalitions of other agents. In the literature, there are also power indices based on minimal winning coalitions. A minimal winning coalition is a coalition that can pass a bill but where the participation of every member is necessary. That is, it is a winning coalition, which is minimal with respect to inclusion. Deegan and Packel (1978) proposed a power index based on the assumption that all minimal winning coalitions are equally likely and that members of a given minimal winning coalition are equally important. Some years latter, Holler (1982) introduced the Public Good index assuming that the source of power of an agent is the number of minimal winning coalitions in which she participates. Power indices based on different assumptions can be found in Johnston (1978), Alonso-Meijide and Freixas (2010), and , among others. 1 Most of the mechanisms of decision making bodies are based on voting. Usually, every agent has certain weight and a proposal is approved when the overall weight of the supporters exceeds a given quota. Most of the times, the quota is fixed at simple majority. The classic way to model these processes is by means of simple games in characteristic function form. These games constitute an important subclass of cooperative games in which the worth of every coalition is either 0 (losing) or 1 (winning), the grand coalition is winning, and if a coalition grows then, its worth cannot decrease.
However, we argue that there are other voting mechanisms in legislatures which fall out of the scope of games in characteristic function. In Spain for instance, the election of the President is a duty of the Parliament. Then, if no candidate is supported by a majority of the members in the chamber, minority governments may emerge. The reason behind the formation of such governments is that the rest of the deputies do not agree in favor of an alternative candidate. We believe that these kind of procedures are better modeled by a plurality rule. According to this rule, the winner is the candidate who pools more votes of members of the Parliament than any other candidate. In Sect. 4 we consider the current Parliament of Andalusia and study winning coalitions with the plurality rule. In case two candidates are supported by the same number of members, we use the votes of citizens as a tie-breaking rule.
Parallel to how games in characteristic function form are appropriate to model the majority rule, games in partition function form (Thrall and Lucas 1963) may be used to describe the plurality rule. In a game in partition function form, the worth of a coalition depends on the arrangement of the rest of agents in coalitions, namely on the whole coalition structure. Therefore, the relevant objects are not coalitions but embedded coalitions that consist of a coalition structure and an active coalition whose worth is being evaluated. Myerson (1977) proposed and characterized an extension of the Shapley value for games in partition function form. Recently, the topic has attracted the attention of researchers and important contributions have been made. For instance, Hafalir (2007) has generalized the concepts of superadditivity and convexity. However, most of the recent contributions deal with generalizations of the Shapley value (see for instance Dutta et al. 2010, and the references therein). In Álvarez-Mozos and Tejada (2015) the Banzhaf value is generalized to games in partition function form.
The literature on simple games in partition function form is quite limited. However, there have been some contributions that are worth mentioning. Bolger (1983Bolger ( , 1990 studied different generalizations of the Shapley-Shubik and Banzhaf indices for multicandidate voting games. These games are {0, 1}-valued but no monotonicity condition is imposed on them. To the best of our knowledge, the only explicit definition of monotonicity for games in partition function form was proposed by Bolger (1986). This property states that if the active coalition grows, while the rest of the agents maintain their coalitional behavior, the worth of the embedded coalition should not decrease. More recently Álvarez-Mozos and Tejada (2015) have proposed the so called ordinal Banzhaf index for this family of simple games in partition function form. Note that, in order to generalize the classic monotonicity property of simple games one just needs to define what growing means for an embedded coalition. Indeed, Myerson (1977) defined a binary relation over the set of embedded coalitions that has been thoroughly studied in Grabisch (2010). From this binary relation, we can infer that an embedded coalition grows when the coalitions, either active or inactive, become larger.
In this paper, we propose a new class of simple games in partition function form. Its main novelty being the monotonicity property that we consider. We assume that an embedded coalition is larger when the active coalition grows while the inactive coalitions become more divided. The plurality rule described above fits this idea of growth. We would like to point out that the same idea was used in a different setting by Carreras and Magaña (2008). However, to the best of our knowledge, it is the first time in which this family of games is studied.
A way to develop power indices for the new family of simple games is to apply values defined for games in partition function form. This is the object of Álvarez-Mozos et al. (2016), where a generalization of the Shapley-Shubik index is characterized. In this paper we take a different approach and generalize the Deegan-Packel and Public Good indices. Moreover, we also provide two characterizations for each index by means of four properties. As we will see, the basic properties of efficiency, null player, and symmetry (Felsenthal and Machover 1998) are easily generalized to our class of games. Then, in order to single out each of the proposed indices we can use either a merging property (Deegan and Packel 1978;Holler and Packel 1983) or a monotonicity property (Lorenzo-Freire et al. 2007;Alonso-Meijide et al. 2008).
The rest of the paper is organized as follows. In Sect. 2 we introduce the key notion of inclusion. This allows us to define monotonic games in partition function form and minimal winning embedded coalitions. In Sect. 3, we introduce the DP and PG power indices. Then, we provide two characterizations of each of them by means of four properties. Finally, in Sect. 4 a real example from the political field is used to illustrate the performance of our indices.

Simple Games in Partition Function Form
Let N be a finite set of players, then the set of partitions of N is denoted by P(N ). For convenience, we assume that the empty set is an element of every partition, i.e., for every P ∈ P(N ), ∅ ∈ P. An embedded coalition of N is a pair (S, P) where P ∈ P(N ) and S ∈ P. We will refer to S as the active coalition in P. The set of embedded coalitions of N is denoted by EC N , i.e. EC N = {(S, P) : P ∈ P(N ) and S ∈ P}. We may abuse language and say that a player i ∈ N participates in an embedded coalition (S, P) ∈ EC N if player i belongs to S. We simplify and write S ∪ i and S\i instead S ∪ {i} and S\{i}, respectively. Given P ∈ P(N ) and a nonempty coalition S ∈ P, we let P −S ∈ P(N \S) denote the partition P\{S}. Lastly, given P ∈ P(N ) and i ∈ N , we denote by P(i) the element of P that contains i, i.e., P(i) ∈ P such that i ∈ P(i).
A game in partition function form is a pair (N , v), where N is the finite set of players and v is the partition function that assigns to every embedded coalition a real number, i.e., v : EC N → R, with the convention that for every P ∈ P(N ), v(∅, P) = 0. The real number v(S, P) is to be understood as the worth of coalition S when the players are organized according to P. The set of games in partition function form with common player set N is denoted by G N and the set of games in partition function form with an arbitrary player set is denoted by G. It is easy to notice that G N is a vector space over R. Indeed, de Clippel and Serrano (2008) devised a basis of the vector space that generalizes the basis of games in characteristic function that consists of unanimity games. Given (S, Then, de Clippel and Serrano (2008) show that N , e (S,P) : (S, P) ∈ EC N and S =∅ constitutes a basis of G N . In this paper we are concerned with a subclass of G that generalizes simple games in characteristic function form as introduced by von Neumann and Morgenstern (1944). For doing so, we develop a concept of monotonicity for games in partition function form. The intuition behind monotonic games is that the enlargement of a coalition cannot cause a decrease in its worth. Therefore, in order to generalize this idea, we use a notion of inclusion for embedded coalitions that will be of key importance for our results and that it is implicitly formulated in Eq. (1).
Definition 2.1 Let N be a finite set and (S, P), (T, Q) ∈ EC N . We define the inclusion among embedded coalitions as follows: According to the above definition, an embedded coalition (S, P) is a subset of another embedded coalition (T, Q) if the coalition S is a subset of T and moreover, the partition {R\T : R ∈ P} is coarser than Q −T . Notice that both families of coalitions are partitions of N \T .
We are now in the position to introduce the class of games under study.

Definition 2.2 A game in partition function form (N , v)
∈ G is said to be a simple game in partition function form if it satisfies the three conditions below: An embedded coalition, (S, P) ∈ EC N , is said to be winning if v(S, P) = 1 and losing otherwise. A game in partition function form satisfying condition (iii) is said to be monotonic. The set of simple games in partition function form with common player set N is denoted by SG N and the set of simple games in partition function form with an arbitrary player set is denoted by SG.
Simple games in partition function form can model parliamentary procedures based on the plurality rule. First, each embedded coalition is either winning or losing. Second, the grand coalition is always winning. 2 Third, suppose that (S, P) ∈ EC N is a winning embedded coalition, then if coalition S grows or the remaining agents are more divided the resulting embedded coalition remains to be winning.
It is straightforward to check that the games that form the basis of de Clippel and Serrano (2008), see Eq.
(1), are instances of simple games in partition function form as defined above. That is, if N is a finite set of players, then for every (S, P) ∈ EC N , N , e (S,P) ∈ SG.
The monotonicity property considered above allows us to properly speak about minimal winning embedded coalitions. Let (N , v) ∈ SG. A winning embedded coalition (S, P) ∈ EC N is said to be minimal if every proper subset of it is a losing embedded coalition, i.e., if (T, Q) (S, P) implies that v(T, Q) = 0. 3 The set of all minimal winning embedded coalitions of a simple game in partition function form is denoted by M(v) and the subset of minimal winning embedded coalitions that contain a given A player i ∈ N is said to be a null player in (N , v) ∈ SG if she does not participate in any minimal winning embedded coalition, i.e., M i (v) = ∅. Similarly, two players i, j ∈ N are said to be symmetric in (N , v) ∈ SG if exchanging the two players does not change the worth of an embedded coalition, i.e., if for every (S, P) ∈ EC N such that S ⊆ N \{i, j}, It is easy to notice, that as a consequence of the monotonicity property, a simple game in partition function form is completely determined by the set of minimal winning embedded coalitions of the game. In a sense, all the relevant information of a simple game in partition function form is condensed in the set of minimal winning embedded coalitions. We state this fact formally in the two propositions below. Proposition 2.1 Every simple game in partition function form can be obtained as the maximum of games in a subset of N , e (S,P) : (S, P) ∈ EC N and S = ∅ . Indeed, for every (N , v)

Power Indices Based on Minimal Winning Embedded Coalitions
In this section, we first propose natural generalizations of the Deegan-Packel and Public Good indices (see Deegan and Packel 1978;Holler 1982) for simple games in partition function form. Next, we consider a number of properties and characterize the proposed indices.
A power index is a mapping, f, that assigns to every simple game Definition 3.1 DP is the power index defined for every (N , v) ∈ SG and i ∈ N by The motivation behind the above definition emerges from three assumptions on how agents behave in a simple game in partition function form. First, only minimal winning embedded coalitions should be considered. The first assumption is twofold, on the one hand it requires the active coalition to be of a minimal size and on the other hand, it demands the inactive coalitions to be of maximal size. Second, every minimal winning embedded coalition emerges with the same probability. Third, the agents participating in a minimal winning embedded coalition share the power equally.
Definition 3.2 PG is the power index defined for every (N , v) ∈ SG and i ∈ N by Similar to DP, the definition of PG above considers that in order to measure the power of an agent in a simple game in partition function form only minimal winning embedded coalitions should be taken into consideration. The main difference lies in the fact that PG is not sensitive to the sizes of minimal winning embedded coalitions. Instead, it suggests that the power of an agent stems from the number of minimal winning embedded coalitions in which she participates. Next, we describe a number of properties that a power index may satisfy. The first three are reformulations of standard axioms in cooperative game theory.
npp A power index f satisfies the null player property if for every (N , v) ∈ SG and every null player i ∈ N in (N , v), sym A power index f satisfies symmetry if for every (N , v) ∈ SG and every pair i, j ∈ N of symmetric players in (N , v), Little discussion is needed on the three properties above. Indeed, they are trivial adaptations of properties that any sensible power index should satisfy (Felsenthal and Machover 1998).
In order to single out the power indices DP or PG we need an additional property. As we will see, the two merging properties introduced in Deegan and Packel (1978) and Holler and Packel (1983) can be easily adapted to our setting of games in partition function form. The common feature of the aforementioned properties is that they require the power in the maximum of certain pairs of simple games to be weighted averages of the powers in the two games. Obviously, the two properties only differ on the weights used in the average. Before we can present these adaptations we have to introduce some additional concepts. For every (N , v), (N , w) ∈ SG, we define the maximum game, (N , v ∨ w) ∈ SG, for every (S, P) ∈ EC N by (v ∨ w)(S, P) = max {v(S, P), w(S, P)}. It is easy to notice that a minimal winning embedded coalition of the maximum game is a minimal winning embedded coalition in one of the two original games. However, there are cases in which minimal winning embedded coalitions in the original games are not so in the maximum game. These situations are ruled out in the following concept. Two simple games in partition function form (N , v), (N , w) ∈ SG are said to be mergeable if

∀(S, P) ∈ M(v) and (T, Q) ∈ M(w), (S, P) (T, Q) and (T, Q) (S, P).
It is straightforward to check that the minimal winning embedded coalitions in the maximum of two mergeable games is precisely the union of the minimal winning embedded coalitions in the original simple games in partition function form. The two properties below describe the distribution of power in the maximum of two mergeable simple games in partition function form.

PG-mer A power index f satisfies PG-mergeability if for every pair of mergeable simple games in partition function form (N , v), (N , w) ∈ SG and every
Both DP-mer and PG-mer state that the power in the maximum of two mergeable simple games in partition function form is a weighted average of the power in each of the original games. According to DP-mer the weights are given by the ratio of the number of minimal winning embedded coalitions in the original game and in the maximum game. Meanwhile, PG-mer uses weights given by the ratio of the sum of cardinalities of minimal winning embedded coalitions in which every agent participates both in the original game and in the maximum game.
Theorem 3.1 DP is the only power index satisfying eff, npp, sym, and DP-mer.
Proof Using the definition, it is straightforward to check that DP satisfies eff, npp, and sym. To see that it also satisfies DP-mer, it is enough to take into account that for every pair of mergeable simple games in partition function form, (N , v) Next, we show that DP is indeed the only power index satisfying eff, npp, sym, and DP-mer. We proceed by induction on the number of minimal winning embedded coalitions. Let f be a power index satisfying the four properties. First, let (N , v) ∈ SG be such that |M(v)| = 1. Then, M(v) = {(S, P)} for some (S, P) ∈ EC N with S = ∅ and v = e (S,P) . It is immediate to check that every i / ∈ S is a null player in N , e (S,P) . Then, by npp, f i N , e (S,P) = 0. Similarly, every pair of players in S are symmetric in N , e (S,P) . Then, by sym they get the same payoff and by eff we conclude that for every i ∈ S, f i N , e (S,P) = 1 |S| . Second, suppose that f is uniquely determined for every (N , v) S 1 , P 1 , . . . , (S r , P r ) . Next, by Proposition 2.1 we have that for every Since S 1 , P 1 , . . . , (S r , P r ) is the set of all minimal winning embedded coalitions of (N , v) then, for every k ∈ {1, . . . , r −1}, S k , P k (S r , P r ) and (S r , P r ) S k , P k . Then, (N , w) and N , e (S r ,P r ) are mergeable games and by DP-mer for every i ∈ N , ( 2) Finally, the two payoffs in the right hand side of the equation above are uniquely determined by the induction hypothesis and the proof concludes.
Theorem 3.2 PG is the only power index satisfying eff, npp, sym, and PG-mer.
Proof It is straightforward to check that PG satisfies eff, npp, and sym. By definition, for every (N , v) ∈ SG and and i ∈ N , follows that PG satisfies PG-mer. The uniqueness part follows the same lines as we did in the proof of Theorem 3.1. The only difference is in the last step where instead of DP-mer we now apply PG-mer and instead of Eq.
(2) we obtain for every i ∈ N . As in the proof of Theorem 3.1, the uniqueness follows by induction.
Next, we introduce two monotonicity properties that give rise to two alternative characterizations of DP and PG. Monotonicity properties describe how the payoff of a given player changes when her position in the game is strengthened. Lorenzo-Freire et al. (2007) and Alonso-Meijide et al. (2008) introduced two monotonicity properties in the context of games in characteristic function that can be easily adapted to games in partition function form. Indeed, consider the following two properties that a power index can be asked to satisfy.
DP-mon A power index f satisfies DP-monotonicity if for every pair of simple games in partition function form, (N , v), (N , w) ∈ SG and every i ∈ N with PG-mon A power index f satisfies PG-monotonicity if for every pair of simple games in partition function form, (N , v), (N , w) ∈ SG and every i ∈ N with Both DP-mon and PG-mon state that when a player participates in more minimal winning embedded coalitions her power scaled by a number increases. According to DP-mon, the power times the number of minimal winning embedded coalitions increases. On the other hand, PG-mon states that the power times the sum of cardinalities of minimal winning embedded coalitions in which every agent participates increases. Note that if the set of minimal winning embedded coalitions in which player i participates is the same in both games, these properties give a direct relation between the power of i in the two games.
Theorem 3.3 DP is the only power index satisfying eff, npp, sym, and DP-mon.
Proof It is clear that DP satisfies eff, npp, and sym. Let (N , v) Then, DP satisfies DP-mon. Next, we prove the uniqueness by induction on |M(v)|. Let f be a power index satisfying eff, npp, sym, and DP-mon. Note that the reasoning in the proof of Theorem 3.1 can be repeated for the base case of the induction. Let us assume that the result is true for all (N , v) ∈ SG with |M(v)| < r , for some r > 1. Let (N , v) ∈ SG such that M(v) = S 1 , P 1 , . . . , (S r , P r ) with r > 1 and R = S 1 ∩ · · · ∩ S r . Note that R = N because r > 1. Then, consider i / ∈ R. If i / ∈ S l for every l = 1, . . . , r , then i is a null player and f i (N , v) = 0 by npp. If there is some l ∈ {1, . . . , r } such that i ∈ S l \R then, define (N , w) ∈ SG with M(w) = M i (v). Since the embedded coalitions in M i (v) are minimal winning in (N , v), there is no inclusion relation among them. Then, by Proposition 2.2, (N , w) ∈ SG is unique and well defined. Next, taking into account that M i (w) = M i (v) and applying the DP-mon property twice, Note that since i / ∈ R, |M(w)| < |M(v)|. Then, the right hand side of Eq. (3) is unique by induction and so, f i (N , v) is uniquely determined. Finally, let i ∈ R. By eff, j∈R f j (N , v) is uniquely determined. Suppose that |R| > 1, otherwise the proof concludes. Notice that every pair of players j, k ∈ R are symmetric in (N , v) ∈ SG. Then by sym, f i (N , v) is also unique.
In a similar way we can characterize the PG power index using the PG-mon property.
Theorem 3.4 PG is the only power index satisfying eff, npp, sym, and PG-mon.
Proof On the one hand, we already know that PG satisfies eff, npp, and sym. By definition, for every (N , v) ∈ SG and i ∈ N , PG i (N , v) j∈N |M j (v)| = |M i (v)| and it follows that PG satisfies PG-mon. On the other hand, for the uniqueness we follow the same lines as in Theorem 3.3. The only difference is in the last step where instead of DP-mon we now apply PG-mon and instead of Eq. (3) we obtain Thus, the uniqueness follows by induction. The reasoning for i ∈ R is analogous.

A Political Example
In this section, we illustrate the performance of the new power indices and compare the distribution of power in the usual simple game in characteristic function with that of the simple game in partition function. The Parliament of Andalusia, one of Spain's seventeen regions, is constituted by 109 members. Since the elections held in 2015, the Parliament consists of 47 members of the social-democratic party PSOE (P S), 33 members of the conservative party PP (P P), 15 members of the new left-wing party Podemos (P O), 9 members of the new liberal party Ciudadanos (C I ), and 5 members of the traditional left-wing party IU (I U ). After a long negotiation process, the candidate of P S was invested President of the regional government with the votes of P S and C I . It is important to point out that we abstract from the ideological and political strategies of the parties. In order to account for these considerations there are more sophisticated models that could be used (see for instance Alonso-Meijide and Bowles 2005;Alonso-Meijide et al. 2009).
In the first place, we consider the most common decision rule in the Parliament which is the simple majority. More precisely, let N = {P S, P P, P O, C I, I U } and w = (w P S , w P P , w P O , w C I , w IU ) = (47, 33, 15, 9, 5) From an inspection of the minimal winning coalitions we conclude that I U is a null player and P P, P O, and C I are symmetric players.
In the second place, we consider a decision procedure based on the plurality rule. To be precise, we define the simple game in partition function form, (N , v) ∈ SG, as follows: (i) If there is one coalition S supported by more members than any other coalition in a given coalition structure P, i.e., if i∈S w i > i∈T w i , for every T ∈ P −S . Then, v(S, P) = 1 and v(T, P) = 0 for every T ∈ P −S . (ii) In case there are draws among the coalitions with maximum overall weight we use a tie-breaking rule to determine the winning coalition. For the case  Notice that in the simple game in partition function described above for every coalition structure there is only one winning coalition.
In Table 1 we list the 9 minimal winning embedded coalitions of the simple game in partition function form.
Observe that there are more minimal winning embedded coalitions in the game in partition function form than minimal winning coalitions in the game in characteristic function form. Given the higher complexity of the model, this is a fact that could be expected. Note that I U is not null when we consider the plurality rule because it participates in two minimal winning embedded coalitions (sixth and ninth rows of Table 1). Another difference that can be observed from the list above is that P P, P O, and C I are not symmetric players anymore.
In Table 2 we depict the Deegan-Packel and Public Good power indices of the parties in the Parliament of Andalusia both when we consider the simple game in characteristic function form (majority rule) and in partition function form (plurality rule). Several comments are in order. First, when we move from the simple majority to the plurality rule, the strongest party becomes more powerful. This can be explained by the fact that with the majority rule P S needs 8 more seats to form a winning coalition. However, when we consider the plurality rule depending on how the rest of the players are organized, P S alone can form a winning coalition (see Table 1). Second, the three parties that were symmetric with the simple majority rule decrease their power. This can also be explained by the fact that it is easier to form a winning coalition with the plurality rule than with the majority rule. Therefore, it is more difficult for intermediate parties to be critical, i.e., it is more difficult for them to participate in a minimal winning embedded coalition. Third, as we have already mentioned I U is not a null player when we consider the plurality rule. This party is too small to participate in a minimal winning coalition with the majority rule, but it participates in two minimal winning embedded coalitions. Fourth, according to the PG index, P P, P O, and C I have the same power. This is surprising given the difference between their seats and because they are not symmetric players. However, it is easy to see from Table 1 that they do participate in the same number of minimal winning embedded coalitions.
Finally, and probably the most surprising observation is that according to the DP index, P O has more power than P P even though it has less seats. In Table 1, we can see that the only difference between P P and P O is in lines 5 and 9. Since the DP index shares the power equally among the members of the active coalition, P O is being allocated more power than P P, even though it has less seats. That is, the DP index does not satisfy local monotonicity. It is easy to find an example to show that the PG index does not satisfy it either. Local monotonicity requires that if player i has less seats than player j, then i cannot have more power than j. Felsenthal and Machover (1995) propose (in addition to three postulates) local monotonicity as major desiderata for a measure of voting power. Even though the DP and PG power indices do not satisfy local monotonicity, they are interesting measures in situations where minimal winning coalitions play an important role. For instance, Holler and Napel (2005) argue that taking only minimal winning coalitions to measure power is adequate because any other winning coalition contains redundant members.

Conclusions
Games in partition function form capture the fact that the value of a group of agents may depend on how the others organize themselves. Here, any kind of unordered partition of the agents is possible in contrast with other models. For instance, the partition is fixed in the a priori unions model (Owen 1977;Hart and Kurz 1983) and in games with r alternatives there is an order in the elements of the partition (see for instance , Bolger 1993;Amer et al. 1998;Carreras and Magaña 2008, among others).
In the literature, as we mention in the introduction, several extensions of simple games have been proposed for games in partition function form. Different approaches arise from different ways of extending the binary relation of inclusion to this setting. We introduce a class of simple games in the context of games in partition function form by defining a property of monotonicity related to the one in Carreras and Magaña (2008) in the setting of games with r alternatives and inspired by the basis proposed by de Clippel and Serrano (2008). The main feature of our inclusion relation is that the active coalition grows while the partition of the remaining agents becomes finer.
In our paper, we have defined and characterized two values which are natural extensions of the Deegan-Packel and Public Good indices, proposed and used to measure power in simple games in characteristic function. A real example, using the plurality voting rule as decision procedure, illustrates their applicability and some of their drawbacks. Indeed, these power indices violate local monotonicity, in the same line as their counterparts for simple games in characteristic function. It is easy to see that other non-local monotonic power indices like the Shift power index (Alonso-Meijide and Freixas 2010) can also be generalized to this framework. The extension of the Banzhaf power index is a topic for future research.
Another interesting issue that remains open is the development of procedures to ease the computation of these indices. Notice that the number of embedded coalitions grows faster than the number of regular coalitions as the number of agents increases. In relation to these, the indices built considering only minimal winning embedded coalitions can be computed in an easier way once they are identified. Then, it can be interesting to find efficient procedures to obtain this type of embedded coalitions. 4