## Introduction

Lloyd Shapley (1923–2016) is perhaps best known for his so-called Shapley value (Shapley, 1953b), interpreted by Roth (1988b, p. 6) as “player i’s ‘fair share’ in the game.” Three other interpretations are a player’s expected marginal contribution, the weighted average of his marginal contributions to the coalition of all n players involved, and what player i can “reasonably” command to himself. The Shapley value influenced Shapley’s subsequent thinking causing the 2012 Nobel Memorial Prize in Economic Sciences (with Alvin E. Roth), “for the theory of stable allocations and the practice of market design.” See Weber (1988) for the well known Shapley value axioms and definitions, Serrano (2018) for a bibliography of Shapley’s contributions, and Yokote et al. (2017) for work relating the Shapley value to other solutions.

Hausken and Mohr (2001) decomposed the Shapley value into a value matrix. The sum of the elements of any row or column in the n × n matrix equals the Shapley value of the respective player in an n-person game. Towards the end of his work on multilinear extensions of games, as an aside at the end of the section labeled “Possible Further Applications,” Owen (1972, p. 76) proposed second order cross-derivatives which “can be thought of as measuring, in some sense, the value of player j to player i,” as discussed by Hausken and Mohr (2001, p. 469). Owen (1972, pp. 77–78) thereafter presented three game examples. In the first three-person majority game he writes that players “1 and 2 are valuable to each other if” player “3 is unlikely to join,” “but get rather in each other’s way” otherwise.

Aside from Hausken and Mohr’s (2001) and Owen’s (1972) contributions, the authors are unaware of other work considering the value of a player or coalition to another player or coalition. The literature has not used this language, and has not approached the phenomenon from this angle. Whereas Hausken and Mohr (2001) present the value of a player to another player, this article generalizes to determine the value of row coalition I to column coalition J in a 2n × 2n value matrix. The matrix is shown to have a variety of desirable properties. The usefulness of the new matrix is that any coalition can value any other coalition regardless of whether the coalitions are disjoint, overlap partly, or coincide. The values of coalitions can thus be conceptualized relative to each other from any imaginable perspective.

Two non-overlapping coalitions in a game may find it useful to know their values to each other. The values are shown to be equal due to symmetry. For example, if the value is negative, both coalitions may have an interest in excluding the other from the game, or ensuring that alternative coalitions are formed. Coalitions may or may not have formed in order to determine their value to each other. If two coalitions overlap, one may have been formed, and may consider its value to another coalition which may form by including or excluding members. Alternatively, a hypothetical coalition, i.e., not yet formed, may consider its value to another already formed coalition. Knowing this value may enable both the potential members of the hypothetical coalition and the members of the already formed coalition to determine whether the already formed coalition should alter its member structure.

Two natural settings for the application of the concept of the value of a coalition to another coalition are as follows. The first is a coalition formation environment, when in the status quo coalitions are already formed. Examples of coalition formation environments are changes and fluctuations in technology, economy, culture, laws, and players’ preferences and beliefs. The second is when there are restrictions in the set of feasible coalitions. Then each formed coalition might contemplate whether to merge with another in line with the concept developed in this article.

The section “Literature review” reviews the literature. The section “Basic definitions” presents basic definitions. The section “The Shapley value of coalition I to coalition J” presents the Shapley value of a coalition to another coalition. The section “Example” illustrates with an example. The section “Interpreting $$\phi _{IJ}\left( {N,v} \right)$$” interprets the various Shapley values. The section “Usefulness, future research and applications” considers usefulness, future research and applications. The section “Applying the weighted Shapley value” applies the weighted Shapley value. The section “Conclusion” concludes.

## Literature review

We suggest that the symmetry in the value of a coalition to another coalition has a weak indirect linkage to Myerson’s (1980) work on balanced contributions and Hart and Mas-Colell’s (1989) work on the preservation of differences for the potential function. Myerson (1977) adapted Shapley’s (1953b) axioms to games in partition function form. Myerson (1980) generalized to conferences of more than two players, and removed the sidepayments assumptions. He showed that any characteristic function game has a unique fair allocation rule which satisfies a balanced contributions formula, related to Harsanyi’s (1963) generalized Shapley value. Hart and Mas-Colell (1989) showed that the potential, i.e., “a real-valued function defined on the space of cooperative games with transferable utility,” satisfying that the marginal contributions of all players are efficient, is unique, and that “the resulting payoff vector coincides with the Shapley value.” The potential yields a new internal consistency property. See Kongo (2018) for further work on balanced contributions.

An indirect linkage also exists between this article and Casajus and Huettner’s (2017) assignment to any player the difference between the worth of the grand coalition and its worth after this player leaves the game. They show that the Shapley value is a unique decomposable decomposer of this assignment.

Earlier work on coalitions has not considered the value of one coalition to another coalition. Maschler (1963) considered the power of a coalition, accounting for the players’ psychology, bargaining abilities, morality, etc., agreeing with Shapley that the Shapley value constitutes an a priori assessment. Aumann and Dreze (1974) developed theorems for the Shapley value, kernel, nucleolus, bargaining set, core, and the von Neumann–Morgenstern solution, “that connect a given solution notion, defined for a coalition structure with the same solution notion applied to appropriately defined games on each of the coalitions in .” Shenoy (1979) suggested two models of coalition formation, using only information in the characteristic function, and illustrating with the Shapley value, the core, the bargaining set, and individually rational payoffs. Kurz (1988) considered some ways in which the Shapley value may be used to determine how various coalition structures impact each player’s payoff. Aumann and Myerson (1988) used an extension of the Shapley value to specify how cooperation between players can be organized, where players choose whether and with whom to establish bilateral links. Hu and Li (2018) axiomatize the Shapley-solidarity value for games with a coalition structure. Skibski et al. (2018) consider the stochastic Shapley value for coalitional games with externalities.

## Basic definitions

A cooperative game (N, v) is defined by a finite set of players N, called the grand coalition, and a characteristic function $$v:2^N \to {\Bbb R}$$ from the set of all possible coalitions of players to a set of payments that satisfies $$v\left( \emptyset \right) = 0$$. The function v describes how much collective payoff a set of players can gain by forming a coalition. Shapley (1953b) assigns a value

$$\phi _i\left( {N,\,v} \right) = {\sum\limits_{\mathop {S \subseteq N,}\limits_{i \in S}}} \frac{{\left( {s - 1} \right)!\left( {n - s} \right)!}}{{n!}}\left( {v\left( S \right) - v\left( {S \setminus \left\{ i \right\}} \right)} \right),\phi _i\left( {S \setminus \left\{ i \right\},\,v} \right) \equiv 0$$
(1)

where s = |S| is the number of players in S, for each game (N, v) for each player i, $$i \in N \subseteq U$$.

Definition 1. The Shapley value of coalition I, $$I \subseteq N$$, equals the sum of the Shapley values for each player i in coalition I, $$i \in I$$, i.e.,

$$\phi _I\left( {N,\,v} \right) \equiv {\sum \limits_{i \in I}} \phi _i\left( {N,\,v} \right)$$
(2)

Hausken and Mohr (2001, p. 469) assign a value $$\phi _{ij}(N,\,v)$$ for each game (N, v) for any two players i and j within the universe U of all possible players, i.e., $$i \in N \subseteq U$$, $$j \in N \subseteq U$$, $$i,\,j = 0,\,1,\,2,\, \ldots ,\,N$$.

Lemma 1. The Shapley value $$\phi _i(N,\,v)$$ for player $$i \in N$$ in a game of n = |N| players, where s = |S| is the number of players in S, is decomposed into n different values $$\phi _{ij}\left( {N,\,v} \right)$$, $$j \in N$$, satisfying

$$\phi _i\left( {N,\,v} \right) = \mathop {\sum }\limits_{j = 1}^n \phi _{ij}\left( {N,\,v} \right)$$
(3)

where

$$\phi _{ij}\left( {N,\,v} \right) = {\sum\limits_{\mathop {S \subseteq N,}\limits_{i,\,j \in S} }} \frac{{\left( {s - 1} \right)!\left( {n - s} \right)!}}{{n!}}\left( {\phi _j\left( {S,\,v} \right) - \phi _j\left( {S \setminus \left\{ i \right\},\,v} \right)} \right),\phi _i\left( {S \setminus \left\{ i \right\},\,v} \right) \equiv 0$$
(4)

and s = |S| is the number of players in S.

Proof. See Hausken and Mohr’s (2001) Theorem 2.1. □

$$\phi _{ij}\left( {N,\,v} \right)$$ in Eq. (4) has the same structure as $$\phi _i(N,v)$$ in Eq. (1), though replacing v(S) with $$\phi _j\left( {S,v} \right)$$ and replacing $$v\left( {S \setminus \left\{ i \right\}} \right)$$ with $$\phi _j\left( {S \setminus \left\{ i \right\},v} \right)$$, and summing over $$S \subseteq N$$ so that $$i,j \in S$$ in Eq. (4), while only $$i \in S$$ in $$\phi _i(S,v)$$.

Definition 2. For all $$i \in N$$, $$j \in N$$,

$$\phi _{\left\{ i \right\}\left\{ j \right\}}\left( {N,v} \right) \equiv \phi _{\left\{ i \right\}j}\left( {N,v} \right) \equiv \phi _{i\left\{ j \right\}}\left( {N,v} \right) \equiv \phi _{ij}\left( {N,v} \right)$$
(5)

Lemma 2. For all $$i \in N$$, $$j \in N$$, the following holds

$$\phi _{ij}\left( {N,v} \right) = \phi _{ji}\left( {N,v} \right)$$
(6)

Proof. Hausken and Mohr (2001) showed in Appendix 1 that

$$\begin{array}{l}\phi _{ij}\left( {N,v} \right) = \mathop {\sum }\limits_{R \subseteq N} \frac{{\left( {r - 1} \right)!\left( {n - r} \right)!}}{{n!}}\\ \times\left[ {\left\{ {v\left( R \right) - {\mathrm{v}}\left( {R \setminus \left\{ j \right\}} \right)} \right\} - \left\{ {{\mathrm{v}}\left( {R \setminus \left\{ i \right\}} \right) - {\mathrm{v}}\left( {R \setminus \left\{ {i,j} \right\}} \right)} \right\}} \right]\mathop {\sum }\limits_{s = r}^n \frac{1}{s}\end{array}$$
(7)

Interchanging i and j does not impact Eq. (7), which implies Eq. (6). Lemma 2 also follows from Myerson’s (1980) axiom of balanced contributions. Segal (2003) refers to term within square brackets in Eq. (7) as “the second-order difference operator.” □

That the value of player i to player j is symmetric was also observed by Owen (1972, p. 76), due to continuity. The symmetry in Lemma 2 is indirectly linked to two earlier contributions, though without conceptualizing the phenomenon as the value of one player to another player. The first is Myerson’s (1980) notion of “balanced contributions,” mathematically related to the Frobenius integrability condition which involves symmetry of the cross partial derivatives. Myerson (1980, p. 173) stated that an allocation rule “has balanced contributions if j’s contribution to i always equals i’s contribution to j, in any conference structure.” The second is Hart and Mas-Colell’s (1989) section 3 labeled “Preservation of Differences.” Hart and Mas-Colell (1989, p. 594) determined the difference to be preserved as “the difference between what i would get if j was not around and what j would get if i was not around.”

Lemma 3. The Shapley value $$\phi _j(N,v)$$ for player $$j \in N$$ in a game of n = |N| players is decomposed into n different values $$\phi _{ij}\left( {N,v} \right)$$, $$i \in N$$, satisfying

$$\phi _j\left( {N,v} \right) = \mathop {\sum }\limits_{i = 1}^n \phi _{ij}\left( {N,v} \right)$$
(8)

Proof. Inserting $$\phi _{ij}\left( {N,v} \right) = \phi _{ji}\left( {N,v} \right)$$ in Eq. (6) into the expression inside the summation sign in Lemma 1 gives

$$\phi _i\left( {N,v} \right) = \mathop {\sum }\limits_{j = 1}^n \phi _{ji}\left( {N,v} \right)$$
(9)

Interchanging i and j in Eq. (9) gives Eq. (8). □

## The Shapley value of coalition I to coalition J

Analogously to the section “Basic definitions”, let us assign a value $$\phi _{IJ}(N,v)$$ for each game (N, v) for any two coalitions I and J within the universe U of all possible players, i.e., $$I \subseteq N \subseteq U$$, $$J \subseteq N \subseteq U$$, where U is finite or infinite. We posit three axioms following Shapley’s (1953b, p. 33) language on p. 33. For axiom 1 Shapley (1953b, p. 32) defines a function πv by $$\pi v\left( {\pi S} \right) = v(S)$$ where $$S \subseteq N \subseteq U$$ and πS is “the image of S under π.”

Axiom 1. Symmetry. For each π in $${\mathrm{{\Pi}}}(U)$$, where $${\mathrm{{\Pi}}}(U)$$ is the set of permutations of the universe U of all possible players, and $$\pi v\left( {\pi S} \right) = v(S)$$ for all $$S \subseteq N \subseteq U$$,

$$\phi _{\pi IJ}\left( {\pi S,\pi v} \right) = \phi _{IJ}\left( {S,v} \right)$$
(10)

For axiom 2 Shapley (1953b, p. 32) defines a carrier of $$v$$ as any set $$S \subseteq N \subseteq U$$ with $$v(S) = v(N \cap S)$$ for all $$S \subseteq U$$. The Shapley value $$\phi _i(N,v)$$ of a null player i in a game (N, v) is zero. A player i is null in (N, v) if $$v\left( {S \cup \left\{ i \right\}} \right) = v\left( S \right)$$ for all coalitions S that do not contain i. In accordance with e.g., Roth (1988a, p. 5), axiom 2 has two parts.

Axiom 2a. Efficiency carrier. For each carrier $$S \subseteq N \subseteq U$$ of v and any partitions pI and pJ of N,

$$\mathop {\sum }\limits_{I \in p_I,J \in p_J} \phi _{IJ}\left( {N,v} \right) = v\left( N \right)$$
(11)

Axiom 2b. Null coalition carrier. If I is a null coalition in v defined as $$v\left( {S \cup I} \right) = v\left( S \right)$$ for all coalitions $$S \subseteq N$$, and/or J is a null coalition in v defined as $$v\left( {S \cup J} \right) = v\left( S \right)$$ for all coalitions $$S \subseteq N$$,

$$\phi _{IJ}\left( {N,v} \right) = 0$$
(12)

Axiom 3. Additivity or law of aggregation. For any two games (N, v) and (N, w) with support equal to N,

$$\begin{array}{l}\phi _{IJ}\left( {N,v} \right) + \phi _{IJ}\left( {N,w} \right) = \phi _{IJ}\left( {N,v + w} \right)\forall I \subseteq N \subseteq U\,{\mathrm{and}}\,\\\forall J \subseteq N \subseteq U ,{\mathrm{i}}{\mathrm{.e}}{\mathrm{.}}\,\phi \left( {N,v} \right) + \phi \left( {N,w} \right) = \phi \left( {N,v + w} \right)\end{array}$$
(13)

Axiom 1 states that coalition names or identities are irrelevant when determining the value $$\phi \left( {N,v} \right)$$. Axiom 2a states that the value $$\phi \left( {N,v} \right)$$ fully distributes the yield of the game, thus excluding e.g., $$\phi _{IJ}\left( {N,v} \right) = v\left( {I \cup J} \right)$$ where any two coalitions I and J assume that all other players and coalitions cooperate against them. A partition pI of a set N, and partition pJ of N, is a grouping of the set’s elements into non-empty subsets so that every element is included in one and only one of the subsets. Applying partitioning preserves the spirit of Shapley’s (1953b) efficiency axiom by ensuring that every individual player is included once (regardless of which subset the player is partitioned into), and also ensuring that no player is included twice (prevents double counting). Axiom 2b states that if at least one of the coalitions I and J is a null coalition, then the value $$\phi _{IJ}\left( {N,v} \right)$$ is zero. A null player or null coalition is a player or coalition which is null in every game (Casajus and Huettner, 2014; van Den Brink, 2007). Axiom 3 states that the values of independent games are added by considering only coalitions I and J in the two games.

These axioms, as formulated by Shapley (1953b, p. 32) for player i, gives a unique solution for player i, which Shapley (1953b, p. 33) finds remarkable. Determining how Lemmas 1–3 for coalitions follow from the axioms is similar to Shapley’s (1953b, p. 33) proof for individual players. However, the axioms for coalitions do not give a unique solution for the value of coalition I to coalition J. Hausken and Mohr (2001, p. 469) do not address the issue of uniqueness for the value of player i to player j. Let us illustrate with an example.

Example. Assume two real parameters a and b such that, for each $$i \in S \subseteq N$$ and $$j \in S \subseteq N$$, $$i \, \ne \, j$$, $$\phi _{ij}\left( {S,v} \right) = a$$, $$\phi _{ii}\left( {S,v} \right) = b$$, where S is a carrier of v, I is a null coalition in v defined as $$v\left( {S \cup I} \right) = v\left( S \right)$$, and $$v\left( N \right) = 1$$. According to the efficiency Axiom 2a for s = |S| players, we must have

$$s\left( {{\mathrm{s}} - 1} \right)a + sb = 1$$
(14)

As alternative 1, $$a = 0$$ and $$b = 1/s$$ cause $$\phi _{ii}\left( {N,v} \right) = \phi _i\left( {N,v} \right)$$ and $$\phi _{ij}\left( {N,v} \right) = 0$$ for $$i \, \ne \, j$$ which satisfy the axioms. As alternative 2, $$a = 1/\left( {s\left( {s - 1} \right)} \right)$$ and $$b = 0$$ cause $$\phi _{ii}\left( {N,v} \right) = 0$$ and $$\phi _{ij}\left( {N,v} \right) = \phi _i\left( {N,v} \right)/\left( {n - 1} \right)$$ for $$i \, \ne \, j$$. Both these two alternatives satisfy the axioms.Footnote 1 This contrasts with Shapley’s (1953b, p. 33) proof, where only one parameter is needed. That is, for each $$i \in S \subseteq N$$, $$\phi _i\left( {N,v} \right) = a$$, which can be computed from efficiency, causing a unique solution for player i. In other words, the Shapley value of coalitions assuming Axiom 1, Axiom 2a, Axiom 2b, and Axiom 3, is not unique, whereas the Shapley value of players is unique. To understand the phenomenon more thoroughly, Tables 1 and 2 present the Shapley value of row coalition I to column coalition J for the two alternatives assuming $$n = \left| N \right| = 3$$ players.

Based on the axioms it cannot be determined whether Tables 1 or 2 is correct. The bottom row where $$I = \left\{ {1,2,3} \right\} = N$$, and right column where $$J = \left\{ {1,2,3} \right\} = N$$, are equivalent in Tables 1 and 2. This suggests that an axiom that merely focuses on the set N of players may be insufficient to cause uniqueness. For example, an axiom such as $$\phi _{IN}\left( {N,v} \right) = \phi _I\left( {N,v} \right)$$ is insufficient, in addition to assuming the result in the Proposition developed below. An alternative axiom such as $$\phi _{iJ}\left( {N,v} \right) = {\sum_{j \in J}} \phi _{ij}\left( {N,v} \right)$$ may be needed, but that also assumes the Proposition developed below. Since both Tables 1 and 2 seem realistic and plausible, it may also be possible that uniqueness is not desirable. That is, why would one choose axioms that might dictate either Tables 1 or 2 as correct, when both may be desirable? Because of these challenges, we leave the issue of one or several additional axioms to ensure uniqueness, or whether uniqueness may not be desirable, as an open research question, and proceed with developing results. □

Definition 3. For all $$I \subseteq N$$, $$J \subseteq N$$,

$$\phi _{I\{ j\} }\left( {N,v} \right) \equiv \phi _{Ij}\left( {N,v} \right),\phi _{\left\{ i \right\}J}\left( {N,v} \right) \equiv \phi _{iJ}\left( {N,v} \right)$$
(15)

Proposition. The Shapley value of coalition I to coalition J, $$I \subseteq N$$, $$J \subseteq N$$, in an n-person game is

$$\phi _{IJ}\left( {N,v} \right) = {\sum\limits_{\mathop {i \in I,}\limits_{j \in J}}} \phi _{ij}\left( {N,v} \right) = \phi _{JI}\left( {N,v} \right)$$
(16)

Proof. If $$I = \left\{ {i,k,\, \ldots ,\,m} \right\} = \left\{ i \right\} \cup \left\{ k \right\} \cup \cdots \cup \left\{ m \right\}$$, $$\left\{ i \right\} \cap \left\{ k \right\} = \cdots = \left\{ i \right\} \cap \left\{ m \right\} = \left\{ k \right\} \cap \left\{ m \right\} = \cdots = \emptyset$$, $$J = \left\{ {j,\,q,\, \ldots ,\,u} \right\} = \left\{ j \right\} \cup \left\{ q \right\} \cup \cdots \cup \left\{ u \right\}$$,$$\left\{ j \right\} \cap \left\{ q \right\} = \cdots = \left\{ j \right\} \cap \left\{ u \right\} = \left\{ q \right\} \cap \left\{ u \right\} = \cdots = \emptyset$$, $$i,\,k,\, \ldots ,\,m,\,j,\,q,\, \ldots ,\,u = 0,\,1,\, \ldots ,\,n$$, Eq. (16) becomes

$$\begin{array}{l}\phi _{IJ}\left( {N,v} \right) = \phi _{ij}\left( {N,v} \right) + \phi _{kj}\left( {N,v} \right) + \cdots + \phi _{mj}\left( {N,v} \right)\\ +\, \phi _{iq}\left( {N,v} \right) + \phi _{kq}\left( {N,v} \right) + \cdots + \phi _{mq}\left( {N,v} \right)\\ + \cdots + \phi _{iu}\left( {N,v} \right) + \phi _{ku}\left( {N,v} \right) + \cdots + \phi _{mu}\left( {N,v} \right)\end{array}$$
(17)

To illustrate consistency, for the three events $$u = n$$, $$m = n$$, $$m = u = n$$, Eq. (17) becomes $$\phi _{IN}\left( {N,v} \right) = \phi _I\left( {N,v} \right)$$, $$\phi _{NJ}\left( {N,v} \right) = \phi _J\left( {N,v} \right)$$, $$\phi _{NN}\left( {N,\,v} \right) = \phi \left( {N,\,v} \right) = v\left( N \right) = v(1,\,2,\, \ldots ,\,n)$$, respectively. Proving that $$\phi _{IJ}\left( {N,v} \right)$$ in Eq. (16) satisfies Axiom 1, Axiom 2a, Axiom 2b, and Axiom 3, follows the same logic as Shapley’s (1953b) proof for $$\phi _i(N,v)$$, and for $$\phi _{ij}\left( {N,v} \right)$$ in Eq. (4) in Lemma 1. To prove that $$\phi _{IJ}\left( {N,v} \right) = \phi _{JI}\left( {N,v} \right)$$, inserting Lemma 2, i.e., $$\phi _{ij}\left( {N,v} \right) = \phi _{ji}\left( {N,v} \right)$$ for all $$i \in N$$, $$j \in N$$, into each term in Eq. (17) gives

$$\begin{array}{*{20}{l}}\phi _{IJ}\left( {N,v} \right) = \phi _{ji}\left( {N,v} \right) + \phi _{jk}\left( {N,v} \right) + \cdots + \phi _{jm}\left( {N,v} \right)\\ +\, \phi _{qi}\left( {N,v} \right) + \phi _{qk}\left( {N,v} \right) + \cdots + \phi _{qm}\left( {N,v} \right)\\ + \cdots + \phi _{ui}\left( {N,v} \right) + \phi _{uk}\left( {N,v} \right) + \cdots + \phi _{um}\left( {N,v} \right) = {\sum\limits_{\mathop {j \in J,}\limits_{i \in I} }} \phi _{ji}\left( {N,v} \right) = \phi _{JI}\left( {N,v} \right)\end{array}$$
(18)

First, the Proposition determines the value of coalition I (to a player or coalition) by summing up the values of each player i in coalition I, $$i \in I$$. Second, the Proposition determines the value (of a player or coalition) to coalition J by summing up the values to each player j in coalition J, $$j \in J$$. Third, summing the value of coalition I and the value to coalition J gives the value of coalition I to coalition J. Fourth, the Proposition applies regardless of whether coalitions I and J overlap or not. Fifth, since an n-person game has 2n possible coalitions, including the null coalition {0} and the set $$N = \{ 1,\,2,\, \ldots ,\,n\}$$ of all players, the Shapley value of row coalition I to column coalition J is exhaustively expressed by a $$2^n \times 2^n$$ matrix. Sixth, the symmetry $$\phi _{IJ}\left( {N,v} \right) = \phi _{JI}\left( {N,v} \right)$$ in the Proposition corresponds to the symmetry in Lemma 2. The nature of the summation in the Proposition is such that the value is symmetric in the sense that the value of coalition I to coalition J equals the value of coalition J to coalition I. □

Corollary 1. The Shapley value of coalition I to itself, $$I \subseteq N$$, in an n-person game equals the sum of the Shapley values of each player i, $$i \in I$$, in coalition I to itself and, due to symmetry, twice the Shapley values of player i to player j given that either $$i \, < \, j$$ or $$i \, > \, j$$, $$j \in I$$, i.e.,

$$\phi _{II}\left( {N,v} \right) = \mathop {\sum }\limits_{i \in I} \phi _{ii}\left( {N,v} \right) + 2{\sum\limits_{\mathop {i \in I,}\limits_{\mathop {j \in J,}\limits_{i < j}}}} \phi _{ij}\left( {N,v} \right) = \mathop {\sum }\limits_{i \in I} \phi _{ii}\left( {N,v} \right) + 2{\sum\limits_{\mathop {i \in I,}\limits_{\mathop {j \in J,}\limits_{i > j}}}} \phi _{ij}\left( {N,v} \right)$$
(19)

Proof. Inserting $$J = I$$ into Eq. (17) while replacing $$J = \left\{ {j,q, \ldots ,u} \right\}$$ with $$I = \left\{ {i,k, \ldots ,m} \right\}$$ gives

$$\begin{array}{l}\phi _{II}\left( {N,v} \right) = \phi _{ii}\left( {N,v} \right) + \phi _{ki}\left( {N,v} \right) + \cdots + \phi _{mi}\left( {N,v} \right)\\ +\, \phi _{ik}\left( {N,v} \right) + \phi _{kk}\left( {N,v} \right) + \cdots + \phi _{mk}\left( {N,v} \right)\\ + \cdots + \phi _{im}\left( {N,v} \right) + \phi _{km}\left( {N,v} \right) + \cdots + \phi _{mm}\left( {N,v} \right)\end{array}$$
(20)

Equation (20) contains the symmetric terms $$\phi _{ki}\left( {N,v} \right)$$ and $$\phi _{ik}\left( {N,v} \right)$$, …, $$\phi _{mi}\left( {N,v} \right)$$ and $$\phi _{im}\left( {N,v} \right)$$, …, and $$\phi _{mk}\left( {N,v} \right)$$ and $$\phi _{km}\left( {N,v} \right)$$. Using Lemma 2, we write these symmetric terms as $$2\phi _{ik}\left( {N,v} \right)$$, …, $$2\phi _{im}\left( {N,v} \right)$$, …, and $$2\phi _{km}\left( {N,v} \right)$$. Inserting into Eq. (20) gives

$$\begin{array}{l}\phi _{II}\left( {N,v} \right) = \phi _{ii}\left( {N,v} \right) + \phi _{kk}\left( {N,v} \right) + \cdots + \phi _{mm}\left( {N,v} \right) + 2\phi _{ik}\left( {N,v} \right)\\ + \cdots + 2\phi _{im}\left( {N,v} \right) + 2\phi _{km}\left( {N,v} \right) + \cdots \end{array}$$
(21)

which is rewritten as Eq. (19). □

Corollary 2. The Shapley value of coalition I to coalition J, the Shapley value of coalition I to the set N of all players, and the Shapley value of the set N of all players to coalition J, where I and J are both strict subsets of N, $$I \subset N$$, $$J \subset N$$, are all less than or equal to the characteristic function $$v\left( N \right)$$ of the set N of all players, i.e.,

$$\phi _{IJ}\left( {N,v} \right) \le v\left( N \right),\phi _{IN}\left( {N,v} \right) \le v\left( N \right),\phi _{NJ}\left( {N,v} \right) \le v\left( N \right),I \subset N,J \subset N$$
(22)

Proof. Follows from the summations in the Proposition, which are all constrained from above by $$\phi _{NN}\left( {N,v} \right) = v\left( N \right)$$. □

Corollary 3. For any partition p of N:

$$\mathop {\sum }\limits_{I \in p} \phi _{Ij}\left( {N,v} \right) = \phi _j\left( {N,v} \right),I \subseteq N,j \in N$$
(23)

Proof. Follows from the Proposition. □

Corollary 3 states that summing up the Shapley value of coalition I to player j, for any partition p of N, equals the Shapley value of player j.

Corollary 4. For any partition p of N:

$$\mathop {\sum }\limits_{J \in p} \phi _{iJ}\left( {N,v} \right) = \phi _i\left( {N,v} \right),J \subseteq N,i \in N$$
(24)

Proof. Follows from the Proposition. □

Corollary 4 states that summing up the Shapley value of player i to coalition J, for any partition p of N, equals the Shapley value of player i.

## Example

Assume that $$S \subseteq N \subseteq U$$ is a carrier of v, and I is a null coalition in v defined as $$v\left( {S \cup I} \right) = v\left( S \right)$$. Hausken and Mohr (2001, p. 468ff) considered the game $$N = \{ 1,2,3\}$$, $$v\left( 1 \right) = 180$$, $$v\left( 2 \right) = v\left( 3 \right) = v\left( {2,3} \right) = 0$$, $$v\left( {1,2} \right) = 360$$, $$v\left( {1,3} \right) = v\left( {1,2,3} \right) = 540$$. Inserting into the definition of $$\phi _i(v,S)$$ gives the Shapley values $$\phi (S,v) = \left[ {\begin{array}{*{20}{c}} {\phi _1\left( {N,v} \right)} & {\phi _2\left( {N,v} \right)} & {\phi _3\left( {N,v} \right)} \end{array}} \right]^T = \left[ {\begin{array}{*{20}{c}} {390} & {30} & {120} \end{array}} \right]^T$$, where T means transposed. The Shapley value of the eight coalitions of the three elements in $$\phi (S,v)$$ is given by Definition 1. The 3 × 3 value matrix $$\phi _{ij}\left( {N,v} \right)$$ giving the Shapley value of row player i to column player j is

$$\phi _{ij}\left( {N,v} \right) = \left[ {\begin{array}{*{20}{c}} {295} & {25} & {70} \\ {25} & {25} & { - 20} \\ {70} & { - 20} & {70} \end{array}} \right]$$
(25)

The 23 × 23 matrix in Table 3 gives the Shapley value of all possible coalitions I to all possible coalitions J according to the Proposition, $$I \subseteq N$$, $$J \subseteq N$$. The 3 × 3 matrix in Eq. (25) is replicated in the upper left part of Table 3, to the right of the 8 × 1 column of 0’s giving the value of coalition I to the null coalition or null player {0}, and below the 1 × 8 row of 0’s giving the value of the null coalition {0} to coalition J. The lower right cell in Table 3 gives the value $$v\left( {1,2,3} \right) = 540$$ according to the Proposition, which is the Shapley value of the set of all players to the set of all players, which equals the Shapley value of the set of all players, which equals the characteristic function $$v\left( N \right)$$ of the set N of all players.Footnote 2

The Proposition for $$I = \{ 2,3\}$$ and j = 3 gives $$\phi _{Ij}\left( {N,v} \right) = 50$$ (row 2 from the bottom and column 5 from the right). The Proposition gives $$\phi _{iJ}\left( {N,v} \right) = 50$$ for $$i = 3$$ and $$J = \{ 2,3\}$$ (column 2 from the right and row 5 from the bottom). The Proposition for $$I = \{ 1,3\}$$ and $$J = \{ 2,3\}$$ gives $$\phi _{IJ}\left( {N,v} \right) = 145$$ (column 2 from the right and row 3 from the bottom). The symmetry across the diagonal from top-left to bottom-right according to the Proposition is such that $$\phi _{JI}\left( {N,v} \right) = 145$$. The value $$145$$ is found by summing four cells determined by the intersection of rows 1 and 3 and columns 2 and 3 in Eq. (25), i.e., $$25 - 20 + 70 + 70 = 145$$.

## Interpreting $${{\phi}} _{{{IJ}}}\left( {{{N}},{{v}}} \right)$$

So far $$\phi _{ij}\left( {N,v} \right)$$ and $$\phi _{IJ}\left( {N,v} \right)$$ are mathematical expressions satisfying the Proposition, Lemmas 1–3, and Corollaries 1–4. We can think of the Shapley value $$\phi _i(N,v)$$ of player i as an element within an n-tuple, the Shapley value $$\phi _{ij}\left( {N,v} \right)$$ of player i to player j as an element within an n × n matrix, and the Shapley value $$\phi _{IJ}\left( {N,v} \right)$$ of coalition I to coalition J as an element within an $$2^n \times 2^n$$ matrix.

Hausken and Mohr (2001, p. 465) identified four interpretations of $$\phi _i(N,v)$$, i.e., player i’s expected marginal contribution to all n players, the weighted average of player i’s marginal contribution to all n players, what player i can reasonably command to himself, or player i’s fair share. See e.g., Roth (1988a) for some similar interpretations. Analogously, $$\phi _{ij}\left( {N,v} \right)$$ is interpreted as player i’s expected marginal contribution to player j in a game of n players, the weighted average of player i’s marginal contribution to player j in a game of n players, what player i can reasonably command to himself when considering only players i and j in a game of n players, or player i’s fair share when considering only players i and j in a game of n players. Also analogously, $$\phi _{IJ}\left( {N,v} \right)$$ is interpreted as coalition I’s expected marginal contribution to coalition J in a game of n players, the weighted average of coalition I’s marginal contribution to coalition J in a game of n players, what coalition I can reasonably command to itself when considering only coalitions I and J in a game of n players, or coalition I’s fair share when considering only coalitions I and J in a game of n players.

Furthermore, Hausken and Mohr (2001, p. 466) interpreted $$\phi _{ij}\left( {N,v} \right)$$ as player i’s power over player j, since player i contributes something player j values highly or is interested in. To the extent player i contributes something player j is interested in, player i has power over player j. This can also be interpreted so that player j depends on player i, since player i contributes something player j desires. Accordingly, $$\phi _{ij}\left( {N,v} \right)$$ can be interpreted as a matrix for the value of player i to player j, as a power matrix for player i’s power over player j, and as an interest matrix for player j’s interest in player i, and as a dependence matrix for how player j depends on player i.Footnote 3

### Disjoint coalitions I and J, $${{I}} \cap {{J}} = {\emptyset}$$

Since one player exists, obviously two or n players also exist. That is, a team or group or collection of players, referred to as a coalition, exists. Hence mathematically, since $$\phi _i(N,v)$$ exists, $$\phi _I(N,v)$$ also exists, $$I \subseteq N$$. We proceed with $$\phi _{Ij}\left( {N,v} \right)$$, first assuming $$I \cap \left\{ j \right\} = \emptyset$$, $$I \subseteq N$$. If $$I = \left\{ {i,k} \right\}$$, the Proposition gives

$$\phi _{Ij}\left( {N,v} \right) = \phi _{ij}\left( {N,v} \right) + \phi _{kj}\left( {N,v} \right)$$
(26)

Hence, since $$\phi _{ij}(N,v)$$ and $$\phi _{kj}\left( {N,v} \right)$$ exist, $$\phi _{Ij}(N,v)$$ exists. That is, since player i and player k individually have values $$\phi _{ij}\left( {N,v} \right)$$ and $$\phi _{kj}\left( {N,v} \right)$$ to player j, coalition $$I = \left\{ {i,k} \right\}$$, which exists, has a value $$\phi _{Ij}\left( {N,v} \right)$$ to player j. This argument applies so that $$\phi _{Ij}(N,v)$$ exists as coalition I expands to $$I = \left\{ {i,k, \ldots ,m} \right\}$$, which means that coalition I has maximally n − 1 members (players) since $$I \cap \left\{ j \right\} = \emptyset$$.

We proceed with $$\phi _{iJ}\left( {N,v} \right)$$, first assuming $$J \cap \left\{ i \right\} = \emptyset$$, $$J \subseteq N$$. If $$J = \left\{ {j,k} \right\}$$, the Proposition gives $$\phi _{iJ}\left( {N,v} \right) = \phi _{ij}\left( {N,v} \right) + \phi _{ik}\left( {N,v} \right)$$. Hence, since $$\phi _{ij}(N,v)$$ and $$\phi _{ik}\left( {N,v} \right)$$ exist, $$\phi _{iJ}(N,v)$$ exists. That is, since player i has a value $$\phi _{ij}\left( {N,v} \right)$$ to player j, and player i has a value $$\phi _{ik}\left( {N,v} \right)$$ to player k, player i has a value $$\phi _{iJ}\left( {N,v} \right)$$ to coalition J, which exists. This argument applies so that $$\phi _{iJ}\left( {N,v} \right)$$ exists as coalition J expands to $$J = \left\{ {j,k, \ldots ,m} \right\}$$, which means that coalition J has maximally n−1 members (players) since $$J \cap \left\{ i \right\} = \emptyset$$.

We proceed with $$\phi _{IJ}\left( {N,v} \right)$$, first assuming $$I \cap J = \emptyset$$, $$I \subseteq N$$, $$J \subseteq N$$. If $$I = \left\{ {i,k} \right\}$$ and $$J = \left\{ {j,q} \right\}$$, the Proposition gives

$$\phi _{IJ}\left( {N,v} \right) = \phi _{ij}\left( {N,v} \right) + \phi _{iq}\left( {N,v} \right) + \phi _{kj}\left( {N,v} \right) + \phi _{kq}\left( {N,v} \right)$$
(27)

Hence, since $$\phi _{ij}(N,v)$$, $$\phi _{iq}\left( {N,v} \right)$$, $$\phi _{kj}\left( {N,v} \right)$$, and $$\phi _{kq}\left( {N,v} \right)$$ exist, $$\phi _{IJ}\left( {N,v} \right)$$ exists. That is, since player i has a value $$\phi _{ij}\left( {N,v} \right)$$ to player j, player i has a value $$\phi _{iq}\left( {N,v} \right)$$ to player q, player k has a value $$\phi _{kj}\left( {N,v} \right)$$ to player j, and player k has a value $$\phi _{kq}\left( {N,v} \right)$$ to player q, coalition I, which exists, has a value $$\phi _{IJ}\left( {N,v} \right)$$ to coalition J, which also exists. This argument applies so that $$\phi _{IJ}\left( {N,v} \right)$$ exists as coalition I expands to $$I = \left\{ {i,k, \ldots ,m} \right\}$$, and coalition J expands to $$J = \left\{ {j,q, \ldots ,u} \right\}$$, where $$I \cap J = \emptyset$$ means that the sum of the number of members (players) in coalitions I and J is equal to or less than n. This completes the interpretation of $$\phi _{IJ}\left( {N,v} \right)$$ for disjoint coalitions I and J, $$I \cap J = \emptyset$$.

### One coalition is a subset of another coalition, $${{I}} \cup {{J}} = {{I}}$$ or $${{I}} \cup {{J}} = {{J}}$$

When one coalition is a subset of another coalition, $$I \cup J = I$$ or $$I \cup J = J$$, i.e., $$I \cap J = I$$ if $$I \subseteq J$$, and $$I \cap J = J$$ if $$J \subseteq I$$. Starting with $$I = J$$, $$\phi _{ii}\left( {N,v} \right)$$ is the value of player i to itself, which exists since $$\phi _{ij}(N,v)$$ exists. The extension from $$\phi _i(N,v)$$ to $$\phi _I(N,v)$$ and subsequent discussion above means that $$\phi _{II}\left( {N,v} \right)$$ is the value of coalition I to itself, which exists, $$I \subseteq N$$.

If $$i \in I$$, $$\phi _{Ii}\left( {N,v} \right)$$ is the value of coalition I to player i which is a member of coalition I. If $$I = \left\{ {i,k, \ldots ,m} \right\} \subseteq N$$, the Proposition implies

$$\phi _{Ii}\left( {N,v} \right) = \phi _{ii}\left( {N,v} \right) + \phi _{ki}\left( {N,v} \right) + \cdots + \phi _{mi}\left( {N,v} \right)$$
(28)

where $$\phi _{ii}\left( {N,v} \right)$$, $$\phi _{ki}\left( {N,v} \right)$$,…, $$\phi _{mi}\left( {N,v} \right)$$ exist as discussed above, and thus $$\phi _{Ii}\left( {N,v} \right)$$ exists for $$i \in I \subseteq N$$.

If $$j \in J$$, $$\phi _{jJ}\left( {N,v} \right)$$ is the value of player j to coalition J, where player j is a member of coalition $$J$$. If $$J = \left\{ {j,q, \ldots ,u} \right\} \subseteq N$$, the Proposition implies

$$\phi _{jJ}\left( {N,v} \right) = \phi _{jj}\left( {N,v} \right) + \phi _{jq}\left( {N,v} \right) + \cdots + \phi _{ju}\left( {N,v} \right)$$
(29)

where $$\phi _{jj}\left( {N,v} \right)$$, $$\phi _{jq}\left( {N,v} \right)$$,…, $$\phi _{ju}\left( {N,v} \right)$$ exist as discussed above, and thus $$\phi _{jJ}\left( {N,v} \right)$$ exists for $$j \in J \subseteq N$$.

If $$I \subseteq J$$, $$\phi _{IJ}\left( {N,v} \right)$$ is the value of coalition I to coalition J, where coalition I is a subcoalition of coalition J. If $$I = \left\{ {i, \ldots ,j} \right\} \subseteq N$$ and $$J = \left\{ {i, \ldots ,j,q, \ldots ,u} \right\} \subseteq N$$, the Proposition implies

$$\begin{array}{l}\phi _{IJ}\left( {N,v} \right) = \phi _{ii}\left( {N,v} \right) + \cdots + \phi _{ji}\left( {N,v} \right) + \cdots + \phi _{ij}\left( {N,v} \right) + \cdots \\ +\, \phi _{jj}\left( {N,v} \right) + \phi _{iq}\left( {N,v} \right)\\ + \cdots + \phi _{jq}\left( {N,v} \right) + \cdots + \phi _{iu}\left( {N,v} \right) + \cdots + \phi _{ju}\left( {N,v} \right)\end{array}$$
(30)

where $$\phi _{ii}\left( {N,v} \right)$$,…, $$\phi _{ji}\left( {N,v} \right)$$,…, $$\phi _{ij}\left( {N,v} \right)$$,…, $$\phi _{jj}\left( {N,v} \right)$$, $$\phi _{iq}\left( {N,v} \right)$$,…, $$\phi _{jq}\left( {N,v} \right)$$,…, $$\phi _{iu}\left( {N,v} \right)$$,…, $$\phi _{ju}\left( {N,v} \right)$$ exist as discussed above, and thus $$\phi _{IJ}\left( {N,v} \right)$$ exists for $$I \subseteq J \subseteq N$$.

If $$J \subseteq I$$, $$\phi _{IJ}\left( {N,v} \right)$$ is the value of coalition I to coalition J which is a subcoalition of coalition I. If $$I = \left\{ {i, \ldots ,j,k, \ldots ,m} \right\} \subseteq N$$ and $$J = \left\{ {i, \ldots ,j} \right\} \subseteq N$$, the Proposition implies

$$\begin{array}{l}\phi _{IJ}\left( {N,v} \right) = \phi _{ii}\left( {N,v} \right) + \cdots + \phi _{ji}\left( {N,v} \right) + \phi _{ki}\left( {N,v} \right) + \cdots + \phi _{mi}\left( {N,v} \right)\\ + \cdots + \phi _{ij}\left( {N,v} \right)\\ + \cdots + \phi _{jj}\left( {N,v} \right) + \phi _{kj}\left( {N,v} \right) + \cdots + \phi _{mj}\left( {N,v} \right)\end{array}$$
(31)

where $$\phi _{ii}\left( {N,v} \right)$$,…, $$\phi _{ji}\left( {N,v} \right)$$, $$\phi _{ki}\left( {N,v} \right)$$,…, $$\phi _{mi}\left( {N,v} \right)$$,…, $$\phi _{ij}\left( {N,v} \right)$$,…, $$\phi _{jj}\left( {N,v} \right)$$, $$\phi _{kj}\left( {N,v} \right)$$,…, $$\phi _{mj}\left( {N,v} \right)$$ exist as discussed above, and thus $$\phi _{IJ}\left( {N,v} \right)$$ exists for $$J \subseteq I \subseteq N$$.

### Overlapping coalitions I and J, $${{I}} \cap {{J}} \, {{\ne}} \, \emptyset$$

We finally consider $$I \cap J \, \ne \, \emptyset$$ where either $$I \subset I \cup J$$ or $$J \subset I \cup J$$, which means that coalition I and coalition J overlap partly. Assume first that $$I = \left\{ {i, \ldots ,j,k, \ldots ,m} \right\} \subseteq N$$ and $$J = \left\{ {i, \ldots ,j,q, \ldots ,u} \right\} \subseteq N$$, where $$\left\{ {k, \ldots ,m} \right\} \cap \left\{ {q, \ldots ,u} \right\} = 0$$. The Proposition implies

$$\begin{array}{l}\phi _{IJ}\left( {N,v} \right) = \phi _{ii}\left( {N,v} \right) + \cdots + \phi _{ji}\left( {N,v} \right) + \phi _{ki}\left( {N,v} \right) + \cdots + \phi _{mi}\left( {N,v} \right) + \cdots + \phi _{ij}\left( {N,v} \right)\\ + \cdots + \phi _{jj}\left( {N,v} \right) + \phi _{kj}\left( {N,v} \right) + \cdots +\, \phi _{mj}\left( {N,v} \right) + \phi _{iq}\left( {N,v} \right) + \cdots + \phi _{jq}\left( {N,v} \right)\\ + \phi _{kq}\left( {N,v} \right) + \cdots +\, \phi _{mq}\left( {N,v} \right) + \cdots + \phi _{iu}\left( {N,v} \right) + \cdots + \phi _{ju}\left( {N,v} \right) +\, \phi _{ku}\left( {N,v} \right) + \cdots + \phi _{mu}\left( {N,v} \right)\end{array}$$
(32)

where $$\phi _{ii}\left( {N,v} \right)$$,…, $$\phi _{ji}\left( {N,v} \right)$$, $$\phi _{ki}\left( {N,v} \right)$$,…, $$\phi _{mi}\left( {N,v} \right)$$,…, $$\phi _{ij}\left( {N,v} \right)$$,…, $$\phi _{jj}\left( {N,v} \right)$$, $$\phi _{kj}\left( {N,v} \right)$$,…, $$\phi _{mj}\left( {N,v} \right)$$, $$\phi _{iq}\left( {N,v} \right)$$,…, $$\phi _{jq}\left( {N,v} \right)$$, $$\phi _{kq}\left( {N,v} \right)$$,…, $$\phi _{mq}\left( {N,v} \right)$$,…, $$\phi _{iu}\left( {N,v} \right)$$,..., $$\phi _{ju}\left( {N,v} \right)$$, $$\phi _{ku}\left( {N,v} \right)$$,…, $$\phi _{mu}\left( {N,v} \right)$$ exist as discussed above, and thus $$\phi _{IJ}\left( {N,v} \right)$$ exists for $$I \subseteq N$$, $$J \subseteq N$$.

Whereas two non-overlapping coalitions I and J, $$I \cap J = \emptyset$$, can form and coexist, two partly overlapping coalitions I and J, $$I \cap J \, \ne \, \emptyset$$, cannot both form and coexist at the same time. Whether no or one or two coalitions have formed or not is irrelevant in this article. The Shapley value $$\phi _{IJ}\left( {N,v} \right)$$ of coalition I to coalition J can always be calculated, even when coalition formation is hypothetical, i.e., regardless how $$I \subseteq N$$ and $$J \subseteq N$$. Each player $$i \in N$$, or any player not involved in the game, considers the hypothetical possibility that coalitions I and J are formed, and determines the value of the former to the latter. The section “Applying the weighted Shapley value” considers how coalitions emerge by assigning different weights to the players, as assumed by Shapley (1953a) and formulated by Dragan (2009) and Kalai and Samet (1987).

## Usefulness, future research, and applications

The practical usefulness is especially evident for disjoint coalitions, since if two coalitions are both valuable to each other, they may merge. The conditions for the merger may depend on the different values they assign to each other. If one coalition values another coalition positively, while the other coalition values the first negatively, a merger may not occur, or may occur if external funding is acquired enabling side payments. If both coalitions value each other negatively, a merger cannot be expected, and the coalitions may be able to explain the non-merger to themselves.

If one coalition is contained within another coalition, as a subset or proper subset, the value of the former to the latter may help determine salaries and reimbursement, and the value of the latter to the former may aid the former in determining whether it should still belong to the latter coalition, e.g., compared against outside options such as external employment opportunities.

If two coalitions overlap, the issue rises of which coalitions have formed and which have not. This article provides Shapley values of coalitions to each other regardless of whether they overlap, have formed, or are hypothetical. First, if none have formed, the values may indicate which should form. Second, if one has formed while the other has not, the values may suggest, indirectly or through some deeper scrutiny, whether this coalition should continue to exist, or whether various alternatives should replace it. Third, two overlapping coalitions may jointly exist when certain conditions exist. For example, the two coalitions may be assigned two different tasks, and the overlapping members work on both tasks. Alternatively, the two coalitions may work on the same task, but the overlapping members keep it as a secret that they also belong to the other coalition. This means analyzing a game with incomplete information, suggested for future research.

The article enables interpreting existing results in innovative ways, recommended for future research. Examples are the various solution notions in cooperative game theory, and the properties for the linkages between these (Driessen, 1988), i.e., particularly the kernel, nucleolus, bargaining set, core, the von Neumann–Morgenstern solution (also known as the stable set), the Shapley value (Aumann and Dreze, 1974), the strong epsilon-core (Shapley and Shubik, 1966), and the core of a simple game with respect to preferences (Nakamura, 1979). For these known results, the value of each player and coalition to each other player and coalition should be determined.

Similar analyses can be conducted for theories of coalition formation. Examples are Myerson’s (1980) conference structures and fair allocation rules, Shenoy’s (1979) models, and work by Kurz (1988) and Aumann and Myerson (1988). Any theory of coalition building needs to account, directly or indirectly, for which values coalitions have to each other. Insights about coalition formation impact which coalitions are likely to form and not form, and which coalitions can be expected to survive or not survive.

Exemplifying practical applications, Hausken and Mohr (2001) applied the analysis to determine the changing values of the members of the European Union in the European Union Council of Ministers during the enlargements in 1973, 1981, 1986, and 1995. The largest players lost voting power. It was shown how the $$\phi _{ij}$$ matrix is applicable to rank the importance of player i to player j. More generally, the $$\phi _{IJ}$$ matrix is applicable to rank the importance of coalition I to coalition J. The example can be extended to the subsequent enlargements since 1995, and Brexit January 31, 2020.

## Applying the weighted Shapley value

One method for assuming different probabilities for which coalitions emerge is to assign different weights to the players, as assumed by Shapley (1953a) for the weighted Shapley value. Kalai and Samet (1987, p. 206) suggested that “bargaining ability, patience rates, or past experience” may impact weights. In addition, some players represent larger constituencies, possess more wealth, have higher competence, etc., which may impact weights. Kalai and Samet (1987, p. 211) assumed the following Axiom 4, required in addition to Axiom 1, Axiom 2a, Axiom 2b, and Axiom 3 for the unique weighted Shapley value $$\phi _w$$:

Axiom 4. Partnership. If, in the game (N, v), for each $$T \subset S$$ and each $$R \subseteq N\backslash S$$, $$v\left( {R \cup T} \right) = v\left( R \right)$$, then

$$\phi _i\left( {v,S} \right) = \phi _i\left( {\mathop {\sum }\limits_{k \in S} \phi _k\left( v \right)u_S,S} \right)\forall i \in S$$
(33)

### Applying Dragan’s (2009) formulation

When $$\lambda _i$$ is the weight assigned to player i for the unanimity game uS within coalition $$S \subseteq N$$, $$S \,\ne \,\emptyset$$, and $$\lambda = [\lambda _1, \ldots ,\lambda _i, \ldots ,\lambda _n] \in R_{ + + }^n$$ is the vector of weights across the n players, player i’s weighted Shapley value is

$$\phi _{wi}\left( {u_S,N,\lambda } \right) = \left\{ {\frac{{\lambda _i}}{\begin{array}{l}\mathop {\sum }\nolimits_{k \in S} \lambda _k\\ 0\,\forall \, i \, \notin \,S\end{array}}\forall i \in S} \right.$$
(34)

Among the many formulations of the weighted Shapley value, Dragan’s (2009, p. 2) Eq. (6) and Radzik’s (2012, p. 409) Eq. (12) retain $$v\left( S \right) - v\left( {S \setminus \left\{ i \right\}} \right)$$, which enables proving Lemma 1w below analogously to proving Lemma 1. Applying Dragan’s (2009) more compact notation, consistently with Shapley (1953a), the weighted Shapley value for player $$i \in N$$ for the game $$(N,v)$$ is

$$\phi _{wi}\left( {v,N,\lambda } \right) = \lambda _i{\sum\limits_{\mathop {S \subseteq N,}\limits_{i \in S} }} \gamma _S\left( {v\left( S \right) - v\left( {S \setminus \left\{ i \right\}} \right)} \right)$$
(35)

where

$$\gamma _S = {\sum\limits_{\mathop {T \subseteq N,}\limits_{T \cap S = \emptyset } }} \frac{{\left( { - 1} \right)^t}}{{\mathop {\sum }\nolimits_{k \in T \cup S} \lambda _k}},\forall S \subseteq N,S \,\ne\, \emptyset$$
(36)

Assuming the unanimity game where $$u_R\left( S \right) = 1$$ if $$R \subseteq S$$ and $$u_R\left( S \right) = 0$$ otherwise, Axiom 1, Axiom 2a, Axiom 2b, and Axiom 3 imply $$\phi _i\left( {u_R,S} \right) = 1/\left| R \right|$$ if $$i \in R$$ and $$\phi _i\left( {u_R,S} \right) = 0$$ otherwise.

Lemma 1w. The weighted Shapley value $$\phi _{wi}(v,N,\lambda )$$ for player $$i \in N$$ in a game of $$n = \left| N \right|$$ players is decomposed into n different values $$\phi _{wij}\left( {v,N,\lambda } \right)$$, $$j \in N$$, satisfying

$$\phi _{wi}\left( {v,N,\lambda } \right) = \mathop {\sum }\limits_{j = 1}^n \phi _{wij}\left( {v,N,\lambda } \right)$$
(37)

where

$$\phi _{wij}\left( {v,N,\lambda } \right) = \lambda _i{\sum\limits_{\mathop {S \subseteq N,}\limits_{i \in S} }} \gamma _S\left( {\phi _{wj}\left( {v,S,\lambda } \right) - \phi _{wj}\left( {v,S \setminus \left\{ i \right\},\lambda } \right)} \right)$$
(38)

Proof. Using Axiom 2a for any subcoalition $$S \subseteq N$$, we rewrite Eq. (35) as

$$\phi _{wi}\left( {v,N,\lambda } \right) = \lambda _i{\sum\limits_{\mathop {S \subseteq N,}\limits_{i \in S} }} \gamma _S\left( {\mathop {\sum }\limits_{j \in S} \phi _{wj}\left( {v,S,\lambda } \right) - {\sum\limits_{\mathop {j \in S,}\limits_{j \ne i} }} \phi _{wj}\left( {v,S,\lambda } \right)} \right)$$
(39)

For any player j outside subcoalition $$S \subseteq N$$, i.e., $$j \,\notin\, S$$, but among the set N of players, i.e., $$j \in N$$, Axiom 2b states that $$\phi _j\left( {v,S} \right) = 0$$. Hence Eq. (39) is rewritten as

$$\phi _{wi}\left( {v,N,\lambda } \right) = \lambda _i{\sum\limits_{\mathop {S \subseteq N,}\limits_{i \in S} }} \gamma _S\left( {\mathop {\sum }\limits_{j = 1}^n \phi _{wj}\left( {v,S,\lambda } \right) - {\sum\limits_{\mathop {j = 1,}\limits_{j \ne i} }^n} \phi _{wj}\left( {v,S,\lambda } \right)} \right)$$
(40)

which is rewritten as

$$\phi _{wi}\left( {v,N,\lambda } \right) = \mathop {\sum }\limits_{j = 1}^n \lambda _i{\sum\limits_{\mathop {S \subseteq N,}\limits_{i \in S} }} \gamma _S\left( {\phi _{wj}\left( {v,S,\lambda } \right) - \phi _{wj}\left( {v,S \setminus \left\{ i \right\},\lambda } \right)} \right)$$
(41)

where λi multiplied by the second summation sign equals $$\phi _{wij}\left( {v,N,\lambda } \right)$$ in Eq. (38). □

Lemma 2w. For all $$i \in N$$, $$j \in N$$,

$$\phi _{wij}\left( {v,N,\lambda } \right) = \phi _{wji}\left( {v,N,\lambda } \right)$$
(42)

Proof. Analogous to the proof of Lemma 2. □

Lemma 3w. The weighted Shapley value $$\phi _{wj}(v,N,\lambda )$$ for player $$j \in N$$ in a game of $$n = \left| N \right|$$ players is decomposed into n different values $$\phi _{wij}\left( {v,N,\lambda } \right)$$, $$i \in N$$, satisfying

$$\phi _{wj}\left( {v,N,\lambda } \right) = \mathop {\sum }\limits_{i = 1}^n \phi _{wij}\left( {v,N,\lambda } \right)$$
(43)

Proof. Analogous to the proof of Lemma 3. □

Proposition w. The weighted Shapley value of coalition I to coalition J, $$I \subseteq N$$, $$J \subseteq N$$, in an n-person game is

$$\phi _{wIJ}\left( {v,N,\lambda } \right) = {\sum\limits_{\mathop {i \in I,}\limits_{j \in J}}} \phi _{wij}\left( {v,N,\lambda } \right) = \phi _{wJI}\left( {v,N,\lambda } \right)$$
(44)

Proof. Analogous to the proof of the Proposition. □

### Applying Kalai and Samet’s (1987) formulation

Kalai and Samet (1987) allowed players to have zero weight, assuming a lexicographic weight system. Their notation is as follows (Kalai and Samet, 1987, pp. 208–209): $${\Bbb R}\left( S \right)$$ is the set of all orders R in coalition S. $$B^{R,i}$$ is the set of players preceding i in R in $${\Bbb R}\left( N \right)$$. For an ordered partition $${\mathrm{{\Sigma}}} = (S_1, \ldots ,S_m)$$ of N, $${\Bbb R}_{\mathrm{{\Sigma}}}$$ is the set of orders for N in which all the players of Si precede those of Si, $$i = 1, \ldots ,m - 1$$. Each R in $${\Bbb R}_{\mathrm{{\Sigma}}}$$ is expressed as $$R = (R_1, \ldots ,R_m)$$, $$R_i \in {\Bbb R}\left( {S_i} \right)$$, $$i = 1, \ldots ,m$$. For $$R = (i_1, \ldots ,i_s)$$ in $${\Bbb R}\left( S \right)$$, $$P_\lambda \left( R \right) = \mathop {\prod }\nolimits_{j = 1}^s \frac{{\lambda _{i_j}}}{{\mathop {\sum }\nolimits_{k = 1}^j \lambda _{i_k}}}$$ is a probability distribution associated with λ over $${\Bbb R}\left( S \right)$$, $$s = \left| S \right|$$, $$\lambda \in E_{ + + }^S$$. $$P_\lambda \left( R \right)$$ is obtainable by arranging the players of S in an order, starting from the end. The probability of adding a player to the beginning of a partially created line is the ratio between the player’s weight and the sum of the weights of the players of S not yet in the line. A probability distribution $$P_\omega$$ over $${\Bbb R}\left( N \right)$$ is associated with each weight system $$\omega = (\lambda ,{\mathrm{{\Sigma}}})$$. $$P_\omega \left( R \right) = \mathop {\prod }\nolimits_{i = 1}^m P_{\lambda _{S_i}}\left( {R_i} \right)$$ for R in $${\Bbb R}_{\mathrm{{\Sigma}}}$$, where $$\lambda _{S_i}$$ is the projection of λ on $$E^{S_i}$$, and $$P_\omega$$ vanishes outside $${\Bbb R}_{\mathrm{{\Sigma}}}$$. Player i’s contribution is $$C_i\left( {v,R} \right) = v\left( {B^{R,i} \cup \left\{ i \right\}} \right) - v\left( {B^{R,i}} \right)$$ for game (N, v) and order R in $${\Bbb R}\left( N \right)$$. Kalai and Samet (1987) proved that the weighted Shapley value of player $$i \in N$$ equals his expected contribution with respect to $$P_\omega$$, i.e.,

$$\phi _{\omega i}\left( {v,N,\omega } \right) = E_{P_\omega }\left( {C_i\left( {v, \cdot } \right)} \right) = E_{P_\omega }\left( {v\left( {B^{ \cdot ,i} \cup \left\{ i \right\}} \right) - v\left( {B^{ \cdot ,i}} \right)} \right)$$
(45)

Lemma 1ω. The weighted Shapley value $$\phi _{\omega i}(v,N,\omega )$$ for player $$i \in N$$ in a game of $$n = \left| N \right|$$ players is decomposed into n different values $$\phi _{\omega ij}\left( {v,N,\omega } \right)$$, $$j \in N$$, satisfying

$$\phi _{\omega i}\left( {v,N,\omega } \right) = \mathop {\sum }\limits_{j = 1}^n \phi _{\omega ij}\left( {v,N,\omega } \right)$$
(46)

where

$$\phi _{\omega ij}\left( {v,N,\omega } \right) = E_{P_\omega }\left( {\phi _{\omega j}\left( {v, \cdot ,\omega } \right) - \phi _{\omega j}\left( {v, \cdot \setminus \left\{ i \right\},\omega } \right)} \right)$$
(47)

Proof. Since Kalai and Samet (1987) in Eq. (45) use · in $$B^{ \cdot ,i}$$ to denote an order, we do the same. Since $$B^{ \cdot ,i}$$ is the set of players preceding i in ·, i is not included in B·,i, whereas i is included in $$B^{ \cdot ,i} \cup \left\{ i \right\}$$. Thus, using Axiom 2a for any subcoalition $$\cdot \subseteq N$$, we rewrite Eq. (45) as

$$\phi _{\omega i}\left( {v,N,\omega } \right) = E_{P_\omega }\left( {\mathop {\sum }\limits_{j \in \cdot } \phi _{\omega j}\left( {v, \cdot ,\omega } \right) - {\sum\limits_{\mathop {j \in \cdot ,}\limits_{j \ne i}}} \phi _{\omega j}\left( {v, \cdot ,\omega } \right)} \right)$$
(48)

For any player j outside order $$\cdot \subseteq N$$, i.e., $$j \,\notin\, \cdot$$, but among the set N of players, i.e., $$j \in N$$, Axiom 2b states that $$\phi _{\omega j}\left( {v, \cdot ,\omega } \right) = 0$$. Hence Eq. (48) is rewritten as

$$\phi _{\omega i}\left( {v,N,\omega } \right) = E_{P_\omega }\left( {\mathop {\sum }\limits_{j = 1}^n \phi _{\omega j}\left( {v, \cdot ,\omega } \right) - {\sum\limits_{\mathop {j = 1,}\limits_{j \ne i}}^n} \phi _{\omega j}\left( {v, \cdot ,\omega } \right)} \right)$$
(49)

which, since the summation can be placed outside the expected value, is rewritten as

$$\phi _{\omega i}\left( {v,N,\omega } \right) = \mathop {\sum }\limits_{j = 1}^n E_{P_\omega }\left( {\phi _{\omega j}\left( {v, \cdot ,\omega } \right) - \phi _{\omega j}\left( {v, \cdot \setminus \left\{ i \right\},\omega } \right)} \right)$$
(50)

where the expression inside the summation sign equals $$\phi _{\omega i}\left( {v,N,\omega } \right)$$ in Eq. (47). □

Lemma 2ω. For all $$i \in N$$, $$j \in N$$,

$$\phi _{\omega ij}\left( {v,N,\omega } \right) = \phi _{\omega ji}\left( {v,N,\omega } \right)$$
(51)

Proof. Analogous to the proof of Lemma 2. □

Lemma 3ω. The weighted Shapley value $$\phi _{\omega j}\left( {v,N,\omega } \right)$$ for player $$j \in N$$ in a game of $$n = \left| N \right|$$ players is decomposed into $$n$$ different values $$\phi _{\omega ij}\left( {v,N,\omega } \right)$$, $$i \in N$$, satisfying

$$\phi _{\omega j}\left( {v,N,\omega } \right) = \mathop {\sum }\limits_{i = 1}^n \phi _{\omega ij}\left( {v,N,\omega } \right)$$
(52)

Proof. Analogous to the proof of Lemma 3. □

Proposition ω. The weighted Shapley value of coalition I to coalition J, $$I \subseteq N$$, $$J \subseteq N$$, in an n-person game is

$$\phi _{\omega IJ}\left( {v,N,\omega } \right) = {\sum\limits_{\mathop {i \in I,}\limits_{j \in J}}} \phi _{\omega ij}\left( {v,N,\omega } \right) = \phi _{\omega JI}\left( {v,N,\omega } \right)$$
(53)

Proof. Analogous to the proof of the Proposition. □

## Conclusion

Shapley’s (1953b) value has set its mark on science. Hausken and Mohr (2001) decomposed the value to a symmetric n × n matrix giving the value $$\phi _{ij}(N,v)$$ of row player i to column player j in a game (N,v) of a set N of players, n = |N|. This article generalizes to a symmetric 2n × 2n matrix giving the value $$\phi _{IJ}(N,v)$$ of row coalition I to column coalition J, observing that an n-person game has 2n coalitions including the empty coalition and the coalition of all n players. Values of coalitions to other coalitions can be positive, zero, or negative. The results also apply for weighted Shapley values.

The Shapley values for an n-person game are usually represented with an n × 1 vector replicated in the bottom row of the 2n × 2n matrix comprising only the columns of individual players numbered from 1 to n, and due to symmetry also replicated in the rightmost column of the 2n × 2n matrix comprising only the rows of individual players numbered from 1 to n. The n × 1 vector is determined by summing the elements in all columns or all rows in the n × n matrix which is replicated in the upper left part of the 2n × 2n matrix comprising rows and columns for the n individual players.

The article presents results, illustrated with an example, demonstrating desirable properties of the matrix. First, the Shapley value of a coalition to a player equals the sum of the Shapley values of all players in the coalition to the given player. Due to symmetry, this equals the value of the given player to the coalition. Second, the Shapley value of a coalition to another coalition equals the sum of the Shapley values of each player in the first coalition to each player in the second coalition, regardless of whether the coalitions are disjoint, overlap partly, or coincide. Third, the Shapley value of a coalition to all players equals the Shapley value of the coalition, which equals the sum of the Shapley values of all players in the coalition. Fourth, the sum of the Shapley values to a player of disjoint coalitions comprising all players equals the Shapley value of the player. Fifth, the sum of the Shapley values of a player to a coalition, among multiple disjoint coalitions comprising all players, equals the Shapley value of the player. All these five values are specified in the corresponding cell in the 2n × 2n matrix. These five values are not provided by specifying the characteristic function for the different coalitions, which merely gives a number for the collective payoff a set of players receives by forming a coalition. Hence the 2n × 2n matrix provides substantially more information than merely calculating the characteristic function. In particular, the value of every player and coalition to every other player and coalition is specified for all possible coalitions. The advantages of the 2n × 2n matrix outweigh the costs of developing it, which is low with today’s computers.