# Shapley value

From Wikipedia the free encyclopedia

Lloyd Shapley in 2012

The Shapley value is a solution concept in cooperative game theory. It was named in honor of Lloyd Shapley, who introduced it in 1951 and won the Nobel Prize in Economics for it in 2012.[1][2] To each cooperative game it assigns a unique distribution (among the players) of a total surplus generated by the coalition of all players. The Shapley value is characterized by a collection of desirable properties. Hart (1989) provides a survey of the subject.[3][4]

The setup is as follows: a coalition of players cooperates, and obtains a certain overall gain from that cooperation. Since some players may contribute more to the coalition than others or may possess different bargaining power (for example threatening to destroy the whole surplus), what final distribution of generated surplus among the players should arise in any particular game? Or phrased differently: how important is each player to the overall cooperation, and what payoff can he or she reasonably expect? The Shapley value provides one possible answer to this question.

For cost-sharing games with concave cost functions, the optimal cost-sharing rule that optimizes the price of anarchy, followed by the price of stability, is precisely the Shapley value cost-sharing rule.[5]

## Formal definition

Formally, a coalitional game is defined as: There is a set N (of n players) and a function ${\displaystyle v}$ that maps subsets of players to the real numbers: ${\displaystyle v\;:\;2^{N}\to \mathbb {R} }$, with ${\displaystyle v(\emptyset )=0}$, where ${\displaystyle \emptyset }$ denotes the empty set. The function ${\displaystyle v}$ is called a characteristic function.

The function ${\displaystyle v}$ has the following meaning: if S is a coalition of players, then ${\displaystyle v}$(S), called the worth of coalition S, describes the total expected sum of payoffs the members of ${\displaystyle S}$ can obtain by cooperation.

The Shapley value is one way to distribute the total gains to the players, assuming that they all collaborate. It is a "fair" distribution in the sense that it is the only distribution with certain desirable properties listed below. According to the Shapley value,[6] the amount that player i gets given a coalitional game ${\displaystyle (v,N)}$ is

${\displaystyle \varphi _{i}(v)=\sum _{S\subseteq N\setminus \{i\}}{\frac {|S|!\;(n-|S|-1)!}{n!}}(v(S\cup \{i\})-v(S))}$

where n is the total number of players and the sum extends over all subsets S of N not containing player i. The formula can be interpreted as follows: imagine the coalition being formed one actor at a time, with each actor demanding their contribution ${\displaystyle v}$(S∪{i}) − ${\displaystyle v}$(S) as a fair compensation, and then for each actor take the average of this contribution over the possible different permutations in which the coalition can be formed.

An alternative equivalent formula for the Shapley value is:

${\displaystyle \varphi _{i}(v)={\frac {1}{n!}}\sum _{R}\left[v(P_{i}^{R}\cup \left\{i\right\})-v(P_{i}^{R})\right]}$

where the sum ranges over all ${\displaystyle n!}$ orders ${\displaystyle R}$ of the players and ${\displaystyle P_{i}^{R}}$ is the set of players in ${\displaystyle N}$ which precede ${\displaystyle i}$ in the order ${\displaystyle R}$. Finally, it can also be expressed as

${\displaystyle \varphi _{i}(v)={\frac {1}{n}}\sum _{S\subseteq N\setminus \{i\}}{\binom {n-1}{|S|}}^{-1}(v(S\cup \{i\})-v(S))}$

which can be interpreted as

${\displaystyle \varphi _{i}(v)={\frac {1}{\text{number of players}}}\sum _{{\text{coalitions excluding }}i}{\frac {{\text{marginal contribution of }}i{\text{ to coalition}}}{{\text{number of coalitions excluding }}i{\text{ of this size}}}}}$

## Examples

Consider a simplified description of a business. An owner, o, provides crucial capital in the sense that without her no gains can be obtained. There are m workers w1,...,wm, each of whom contributes an amount p to the total profit. Let

${\displaystyle N=\{o,w_{1},\ldots ,w_{m}\}.}$

The value function for this coalitional game is

${\displaystyle v(S)={\begin{cases}mp,&{\text{if }}o\in S\\0,&{\text{otherwise}}\\\end{cases}}}$

where m is the cardinality of ${\displaystyle S\setminus \{o\}}$. Computing the Shapley value for this coalition game leads to a value of mp/2 for the owner and p/2 for each one of the m workers.

### Glove game

The glove game is a coalitional game where the players have left- and right-hand gloves and the goal is to form pairs. Let

${\displaystyle N=\{1,2,3\},}$

where players 1 and 2 have right-hand gloves and player 3 has a left-hand glove.

The value function for this coalitional game is

${\displaystyle v(S)={\begin{cases}1&{\text{if }}S\in \left\{\{1,3\},\{2,3\},\{1,2,3\}\right\};\\0&{\text{otherwise}}.\\\end{cases}}}$

The formula for calculating the Shapley value is

${\displaystyle \varphi _{i}(v)={\frac {1}{|N|!}}\sum _{R}\left[v(P_{i}^{R}\cup \left\{i\right\})-v(P_{i}^{R})\right],}$

where R is an ordering of the players and ${\displaystyle P_{i}^{R}}$ is the set of players in N which precede i in the order R.

The following table displays the marginal contributions of Player 1.

${\displaystyle {\begin{array}{|c|r|}{\text{Order }}R\,\!&MC_{1}\\\hline {1,2,3}&v(\{1\})-v(\varnothing )=0-0=0\\{1,3,2}&v(\{1\})-v(\varnothing )=0-0=0\\{2,1,3}&v(\{1,2\})-v(\{2\})=0-0=0\\{2,3,1}&v(\{1,2,3\})-v(\{2,3\})=1-1=0\\{3,1,2}&v(\{1,3\})-v(\{3\})=1-0=1\\{3,2,1}&v(\{1,2,3\})-v(\{2,3\})=1-1=0\end{array}}}$

Observe

${\displaystyle \varphi _{1}(v)=\!\left({\frac {1}{6}}\right)(1)={\frac {1}{6}}.}$

By a symmetry argument it can be shown that

${\displaystyle \varphi _{2}(v)=\varphi _{1}(v)={\frac {1}{6}}.}$

Due to the efficiency axiom, the sum of all the Shapley values is equal to 1, which means that

${\displaystyle \varphi _{3}(v)={\frac {4}{6}}={\frac {2}{3}}.}$

## Properties

The Shapley value has many desirable properties.

### Efficiency

The sum of the Shapley values of all agents equals the value of the grand coalition, so that all the gain is distributed among the agents:

${\displaystyle \sum _{i\in N}\varphi _{i}(v)=v(N)}$

Proof: ${\displaystyle \sum _{i\in N}\varphi _{i}(v)={\frac {1}{|N|!}}\sum _{R}\sum _{i\in N}v(P_{i}^{R}\cup \left\{i\right\})-v(P_{i}^{R})={\frac {1}{|N|!}}\sum _{R}v(N)={\frac {1}{|N|!}}|N|!\cdot v(N)=v(N)}$

since ${\displaystyle \sum _{i\in N}v(P_{i}^{R}\cup \left\{i\right\})-v(P_{i}^{R})}$ is a telescoping sum and there are |N|! different orderings R.

### Symmetry

If ${\displaystyle i}$ and ${\displaystyle j}$ are two actors who are equivalent in the sense that

${\displaystyle v(S\cup \{i\})=v(S\cup \{j\})}$

for every subset ${\displaystyle S}$ of ${\displaystyle N}$ which contains neither ${\displaystyle i}$ nor ${\displaystyle j}$, then ${\displaystyle \varphi _{i}(v)=\varphi _{j}(v)}$.

This property is also called equal treatment of equals.

### Linearity

If two coalition games described by gain functions ${\displaystyle v}$ and ${\displaystyle w}$ are combined, then the distributed gains should correspond to the gains derived from ${\displaystyle v}$ and the gains derived from ${\displaystyle w}$:

${\displaystyle \varphi _{i}(v+w)=\varphi _{i}(v)+\varphi _{i}(w)}$

for every ${\displaystyle i}$ in ${\displaystyle N}$. Also, for any real number ${\displaystyle a}$,

${\displaystyle \varphi _{i}(av)=a\varphi _{i}(v)}$

for every ${\displaystyle i}$ in ${\displaystyle N}$.

### Null player

The Shapley value ${\displaystyle \varphi _{i}(v)}$ of a null player ${\displaystyle i}$ in a game ${\displaystyle v}$ is zero. A player ${\displaystyle i}$ is null in ${\displaystyle v}$ if ${\displaystyle v(S\cup \{i\})=v(S)}$ for all coalitions ${\displaystyle S}$ that do not contain ${\displaystyle i}$.

Given a player set ${\displaystyle N}$, the Shapley value is the only map from the set of all games to payoff vectors that satisfies all four properties: Efficiency, Symmetry, Linearity, Null player.

### Stand-alone test

If v is a subadditive set function, i.e., ${\displaystyle v(S\sqcup T)\leq v(S)+v(T)}$, then for each agent i: ${\displaystyle \varphi _{i}(v)\leq v(\{i\})}$.

Similarly, if v is a superadditive set function, i.e., ${\displaystyle v(S\sqcup T)\geq v(S)+v(T)}$, then for each agent i: ${\displaystyle \varphi _{i}(v)\geq v(\{i\})}$.

So, if the cooperation has positive externalities, all agents (weakly) gain, and if it has negative externalities, all agents (weakly) lose.[7]:147–156

### Anonymity

If i and j are two agents, and w is a gain function that is identical to v except that the roles of i and j have been exchanged, then ${\displaystyle \varphi _{i}(v)=\varphi _{j}(w)}$. This means that the labeling of the agents doesn't play a role in the assignment of their gains.

### Marginalism

The Shapley value can be defined as a function which uses only the marginal contributions of player i as the arguments.

## Characterization

The Shapley value not only has desirable properties, it is also the only payment rule satisfying some subset of these properties. For example, it is the only payment rule satisfying the four properties of Efficiency, Symmetry, Linearity and Null player.[8] See [7]:147–156 for more characterizations.

## Aumann–Shapley value

In their 1974 book, Lloyd Shapley and Robert Aumann extended the concept of the Shapley value to infinite games (defined with respect to a non-atomic measure), creating the diagonal formula.[9] This was later extended by Jean-François Mertens and Abraham Neyman.

As seen above, the value of an n-person game associates to each player the expectation of his contribution to the worth or the coalition or players before him in a random ordering of all the players. When there are many players and each individual plays only a minor role, the set of all players preceding a given one is heuristically thought as a good sample of the players so that the value of a given infinitesimal player ds around as "his" contribution to the worth of a "perfect" sample of the population of all players.

Symbolically, if v is the coalitional worth function associating to each coalition c measured subset of a measurable set I that can be thought as ${\displaystyle I=[0,1]}$ without loss of generality.

${\displaystyle (Sv)(ds)=\int _{0}^{1}(v(tI+ds)-v(tI))\,dt.}$

where ${\displaystyle (Sv)(ds)}$denotes the Shapley value of the infinitesimal player ds in the game, tI is a perfect sample of the all-player set I containing a proportion t of all the players, and ${\displaystyle tI+ds}$ is the coalition obtained after ds joins tI. This is the heuristic form of the diagonal formula.

Assuming some regularity of the worth function, for example assuming v can be represented as differentiable function of a non-atomic measure on I, μ, ${\displaystyle v(c)=f(\mu (c))}$ with density function ${\displaystyle \varphi }$, with ${\displaystyle \mu (c)=\int 1_{c}(u)\varphi (u)\,du,}$ ( ${\displaystyle 1_{c}()}$ the characteristic function of c). Under such conditions

${\displaystyle \mu (tI)=t\mu (I)}$,

as can be shown by approximating the density by a step function and keeping the proportion t for each level of the density function, and

${\displaystyle v(tI+ds)=f(t\mu (I))+f'(t\mu (I))\mu (ds).}$

The diagonal formula has then the form developed by Aumann and Shapley (1974)

${\displaystyle (Sv)(ds)=\int _{0}^{1}f'_{t\mu (I)}(\mu (ds))\,dt}$

Above μ can be vector valued (as long as the function is defined and differentiable on the range of μ, the above formula makes sense).

In the argument above if the measure contains atoms ${\displaystyle \mu (tI)=t\mu (I)}$ is no longer true—this is why the diagonal formula mostly applies to non-atomic games.

Two approaches were deployed to extend this diagonal formula when the function f is no longer differentiable. Mertens goes back to the original formula and takes the derivative after the integral thereby benefiting from the smoothing effect. Neyman took a different approach. Going back to an elementary application of Mertens's approach from Mertens (1980):[10]

${\displaystyle (Sv)(ds)=\lim _{\varepsilon \to 0,\varepsilon >0}{\frac {1}{\varepsilon }}\int _{0}^{1-\varepsilon }(f(t+\varepsilon \mu (ds))-f(t))\,dt}$

This works for example for majority games—while the original diagonal formula cannot be used directly. How Mertens further extends this by identifying symmetries that the Shapley value should be invariant upon, and averaging over such symmetries to create further smoothing effect commuting averages with the derivative operation as above.[11] A survey for non atomic value is found in Neyman (2002)[12]

## Generalization to coalitions

The Shapley value only assigns values to the individual agents. It has been generalized[13] to apply to a group of agents C as,

${\displaystyle \varphi _{C}(v)=\sum _{T\subseteq N\setminus C}{\frac {(n-|T|-|C|)!\;|T|!}{(n-|C|+1)!}}\sum _{S\subseteq C}(-1)^{|C|-|S|}v(S\cup T)\;.}$

## In machine learning

The Shapley value provides a principled way to explain the predictions of nonlinear models common in the field of machine learning. By interpreting a model trained on a set of features as a value function on a coalition of players, Shapley values provide a natural way to compute which features contribute to a prediction.[14] This unifies several other methods including Locally Interpretable Model-Agnostic Explanations (LIME),[15] DeepLIFT,[16] and Layer-Wise Relevance Propagation.[17]

## References

1. ^ Shapley, Lloyd S. (August 21, 1951). "Notes on the n-Person Game -- II: The Value of an n-Person Game" (PDF). Santa Monica, Calif.: RAND Corporation.
2. ^ Roth, Alvin E., ed. (1988). The Shapley Value: Essays in Honor of Lloyd S. Shapley. Cambridge: Cambridge University Press. doi:10.1017/CBO9780511528446. ISBN 0-521-36177-X.
3. ^ Hart, Sergiu (1989). "Shapley Value". In Eatwell, J.; Milgate, M.; Newman, P. (eds.). The New Palgrave: Game Theory. Norton. pp. 210–216. doi:10.1007/978-1-349-20181-5_25. ISBN 978-0-333-49537-7.
4. ^ Hart, Sergiu (May 12, 2016). "A Bibliography of Cooperative Games: Value Theory".
5. ^ Phillips, Matthew; Marden, Jason R. (July 2018). "Design Tradeoffs in Concave Cost-Sharing Games". IEEE Transactions on Automatic Control. 63 (7): 2242–2247. doi:10.1109/tac.2017.2765299. ISSN 0018-9286.
6. ^ For a proof of unique existence, see Ichiishi, Tatsuro (1983). Game Theory for Economic Analysis. New York: Academic Press. pp. 118–120. ISBN 0-12-370180-5.
7. ^ a b Herve Moulin (2004). Fair Division and Collective Welfare. Cambridge, Massachusetts: MIT Press. ISBN 9780262134231.
8. ^ Shapley, Lloyd S. (1953). "A Value for n-person Games". In Kuhn, H. W.; Tucker, A. W. (eds.). Contributions to the Theory of Games. Annals of Mathematical Studies. 28. Princeton University Press. pp. 307–317. doi:10.1515/9781400881970-018. ISBN 9781400881970.
9. ^ Aumann, Robert J.; Shapley, Lloyd S. (1974). Values of Non-Atomic Games. Princeton: Princeton Univ. Press. ISBN 0-691-08103-4.
10. ^ Mertens, Jean-François (1980). "Values and Derivatives". Mathematics of Operations Research. 5 (4): 523–552. doi:10.1287/moor.5.4.523. JSTOR 3689325.
11. ^ Mertens, Jean-François (1988). "The Shapley Value in the Non Differentiable Case". International Journal of Game Theory. 17 (1): 1–65. doi:10.1007/BF01240834.
12. ^ Neyman, A., 2002. Value of Games with infinitely many Players, "Handbook of Game Theory with Economic Applications," Handbook of Game Theory with Economic Applications, Elsevier, edition 1, volume 3, number 3, 00. R.J. Aumann & S. Hart (ed.).[1]
13. ^ Grabisch, Michel; Roubens, Marc (1999). "An axiomatic approach to the concept of interaction among players in cooperative games". International Journal of Game Theory. 28: 547-565. doi:10.1007/s001820050125.
14. ^ Lundberg, Scott M.; Lee, Su-In. "A Unified Approach to Interpreting Model Predictions". Advances in Neural Information Processing Systems. 30: 4765–4774. Retrieved 2021-01-30.
15. ^ Ribeiro, Marco Tulio; Singh, Sameer; Guestrin, Carlos (2016-08-13). "Why Should I Trust You?". New York, NY, USA: ACM. doi:10.1145/2939672.2939778. ISBN 978-1-4503-4232-2.
16. ^ Shrikumar, Avanti; Greenside, Peyton; Kundaje, Anshul (2017-07-17). "Learning Important Features Through Propagating Activation Differences". PMLR. pp. 3145–3153. ISSN 2640-3498. Retrieved 2021-01-30.
17. ^ Bach, Sebastian; Binder, Alexander; Montavon, Grégoire; Klauschen, Frederick; Müller, Klaus-Robert; Samek, Wojciech (2015-07-10). Suarez, Oscar Deniz (ed.). "On Pixel-Wise Explanations for Non-Linear Classifier Decisions by Layer-Wise Relevance Propagation". PLOS ONE. Public Library of Science (PLoS). 10 (7): e0130140. doi:10.1371/journal.pone.0130140. ISSN 1932-6203.