Editing Shapley value

{{short description|Concept in game theory}}
In [[cooperative game theory]], the '''Shapley value''' is a method ([[solution concept]]) for fairly distributing the total gains or costs among a group of players who have collaborated. For example, in a team project where each member contributed differently, the Shapley value provides a way to determine how much credit or blame each member deserves. It was named in honor of [[Lloyd Shapley]], who introduced it in 1951 and won the [[Nobel Memorial Prize in Economic Sciences]] for it in 2012.<ref>{{cite web |last=Shapley |first=Lloyd S. |date=August 21, 1951 |title=Notes on the n-Person Game -- II: The Value of an n-Person Game |url=https://www.rand.org/content/dam/rand/pubs/research_memoranda/2008/RM670.pdf |publisher=RAND Corporation |location=Santa Monica, Calif. |number=RM-670}}</ref><ref>{{cite book |title=The Shapley Value: Essays in Honor of Lloyd S. Shapley |publisher=Cambridge University Press |year=1988 |isbn=0-521-36177-X |editor-last=Roth |editor-first=Alvin E. |location=Cambridge |doi=10.1017/CBO9780511528446}}</ref> 

The Shapley value determines each player's contribution by considering how much the overall outcome changes when they join each possible combination of other players, and then averaging those changes. In essence, it calculates each player's average marginal contribution across all possible coalitions.<ref>{{cite book |last=Hart |first=Sergiu |title=The New Palgrave: Game Theory |publisher=Norton |year=1989 |isbn=978-0-333-49537-7 |editor-last=Eatwell |editor-first=J. |pages=210–216 |chapter=Shapley Value |doi=10.1007/978-1-349-20181-5_25 |editor2-last=Milgate |editor2-first=M. |editor3-last=Newman |editor3-first=P.}}</ref><ref>{{cite web |last=Hart |first=Sergiu |date=May 12, 2016 |title=A Bibliography of Cooperative Games: Value Theory |url=http://www.ma.huji.ac.il/~hart/value.html}}</ref> It is the only solution that satisfies four fundamental properties: efficiency, symmetry, additivity, and the dummy player (or null player) property,<ref name=":2" /> which are widely accepted as defining a fair distribution.

This method is used in many fields, from dividing profits in business partnerships to understanding feature importance in [[machine learning]].[[File:Lloyd Shapley 2 2012.jpg|thumb|Lloyd Shapley in 2012]]
== Formal definition ==

Formally, a '''coalitional game''' is defined as:
There is a set ''N'' (of ''n'' players) and a [[function (mathematics)|function]] <math> v </math> that maps subsets of players to the real numbers:  <math> v \colon 2^N \to \mathbb{R} </math>, with <math> v ( \emptyset ) = 0 </math>, where <math>\emptyset</math> denotes the empty set. The function <math> v </math> is called a characteristic function.

The function <math>v</math> has the following meaning: if <math>S</math> is a coalition of players, then <math>v(S)</math>, called the worth of coalition <math>S</math> describes the total expected sum of payoffs the members of <math>S</math> 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,<ref>For a proof of unique existence, see {{cite book |first=Tatsuro |last=Ichiishi |title=Game Theory for Economic Analysis |location=New York |publisher=Academic Press |year=1983 |isbn=0-12-370180-5 |pages=118–120 |url=https://books.google.com/books?id=zFm7AAAAIAAJ&pg=PA118 }}</ref> the amount that player <math>i</math> is given in a coalitional game <math>(v, N) </math> is

:<math>\varphi_i(v)=\sum_{S \subseteq N \setminus
\{i\}} \frac{|S|!\; (n-|S|-1)!}{n!}(v(S\cup\{i\})-v(S)) </math>
:<math> \quad \quad \quad = \frac{1}{n} \sum_{S \subseteq N \setminus
\{i\}} {n - 1 \choose |S|}^{-1} (v(S\cup\{i\})-v(S)) </math>

where <math>n</math> is the total number of players and the sum extends over all subsets <math>S</math> of <math>N</math> not containing player <math>i</math>, including the empty set. Also note that <math>{n \choose k}</math> is the [[binomial coefficient]]. The formula can be interpreted as follows: imagine the coalition being formed one actor at a time, with each actor demanding their contribution <math>v(S\cup \{ i \} ) - v(S)</math> as a fair compensation, and then for each actor take the average of this contribution over the possible different [[permutation]]s in which the coalition can be formed.

An alternative equivalent formula for the Shapley value is:

:<math>\varphi_i(v)= \frac{1}{n!}\sum_R\left [ v(P_i^R \cup \left \{ i \right \}) - v(P_i^R) \right ]</math>

where the sum ranges over all <math>n!</math> orders <math>R</math> of the players and <math>P_i^R</math> is the set of players in <math>N</math> which precede <math>i</math> in the order <math>R</math>.

=== In terms of synergy ===
[[File:Shapley Value Venn Diagram.jpg|thumb|Venn Diagram displaying synergies for Shapley values]]

[[File:Shapley Value Synergy Division Venn Diagram.jpg|thumb|Venn Diagram of the division of synergies that sum to the Shapley Value]]

From the characteristic function <math>v</math> one can compute the ''synergy'' that each group of players provides. The synergy is the unique function <math> w \colon 2^N \to \mathbb{R} </math>, such that

: <math>v(S) = \sum_{R \subseteq S } w(R) </math>

for any subset <math>S \subseteq N </math> of players. In other words, the 'total value' of the coalition <math>S</math> comes from summing up the ''synergies'' of each possible subset of <math>S</math>.

Given a characteristic function <math>v</math>, the synergy function <math>w</math> is calculated via

: <math>w(S) = \sum_{R \subseteq S } (-1)^{|S| - |R|}  v(R) </math>

using the [[Inclusion-exclusion principle#Other forms|Inclusion exclusion principle]]. In other words, the synergy of coalition <math>S</math> is the value <math>v(S)</math> , which is not already accounted for by its subsets.

The Shapley values are given in terms of the synergy function by<ref name="Grabisch Representations">{{Cite journal|last=Grabisch|first=Michel|date=October 1997|title=Alternative Representations of Discrete Fuzzy Measures for Decision Making|journal=International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems|language=en-US|volume=5|issue=5|pages=587–607|doi=10.1142/S0218488597000440|issn=0218-4885}}</ref><ref name="Grabisch Representations 2">{{cite journal |last1=Grabisch |first1=Michel |title=k-order additive discrete fuzzy measures and their representation |journal=Fuzzy Sets and Systems |date=1 December 1997 |volume=92 |issue=2 |pages=167–189 |doi=10.1016/S0165-0114(97)00168-1|issn=0165-0114}}</ref>

: <math>\varphi_i(v) = \sum_{i \in S \subseteq N } \frac{w(S)}{|S|} </math>

where the sum is over all subsets <math>S</math> of <math>N</math> that include player <math>i</math>.

This can be interpreted as

: <math>\varphi_i(v) = \sum_{\text{coalitions including i}} \frac{\text{synergy of the coalition}}{\text{number of members in the coalition}} </math>

In other words, the synergy of each coalition is divided equally between all members.

This can be interpreted visually with a [[Venn Diagram]]. In the first example diagram above, each region has been labeled with the synergy bonus of the corresponding coalition. The total value produced by a coalition is the sum of synergy bonuses of the composing subcoalitions - in the example, the coalition of the players labeled "You" and "Emma" would produce a profit of <math> 30+20+40=90 </math> dollars, as compared to their individual profits of <math> 30 </math> and <math> 20 </math> dollars respectively. The synergies are then split equally among each member of the subcoalition that contributes that synergy - as displayed in the second diagram.

== Examples ==
=== Business example ===
Consider a simplified description of a business. An owner, ''o'', provides crucial capital in the sense that, without him/her, no gains can be obtained. There are ''m'' workers ''w''<sub>1</sub>,...,''w''<sub>''m''</sub>, each of whom contributes an amount ''p'' to the total profit. Let

:<math>N = \{o, w_1,\ldots,w_m\}.</math>

The value function for this coalitional game is
:<math>
v(S) = 
\begin{cases}
  (|S|-1)p  & \text{if }o \in S\;,\\
  0 & \text{otherwise}\;.\\
\end{cases}
</math>
Computing the Shapley value for this coalition game leads to a value of {{sfrac|''mp''|2}} for the owner and {{sfrac|''p''|2}} for each one of the ''m'' workers.

This can be understood from the perspective of synergy. The synergy function <math>w</math> is
:<math>
w(S) = 
\begin{cases}
  p,  & \text{if } S = \{ o, w_i \} \\
  0, & \text{otherwise}\\
\end{cases}
</math>

so the only coalitions that generate synergy are one-to-one between the owner and any individual worker.

Using the above formula for the Shapley value in terms of <math>w</math> we compute

: <math>\varphi_{w_i} = \frac{w(\{o, w_i \})}{2} = \frac{p }{2} </math>
and
: <math>\varphi_o = \sum_{i=1}^m \frac{w(\{o, w_i \})}{2} = \frac{m p }{2} </math>

The result can also be understood from the perspective of averaging over all orders. A given worker joins the coalition after the owner (and therefore contributes ''p'') in half of the orders and thus makes an average contribution of <math>\frac p2</math> upon joining. When the owner joins, on average half the workers have already joined, so the owner's average contribution upon joining is <math>\frac{mp}2</math>.

=== 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
:<math>N = \{1, 2, 3\},</math>
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
:<math>
v(S) = 
\begin{cases}
  1  & \text{if }S \in \left\{ \{1,3\},\{2,3\},\{1,2,3\} \right\};\\
  0 & \text{otherwise}.\\
\end{cases}
</math>

The formula for calculating the Shapley value is

:<math>\varphi_i(v)= \frac{1}{|N|!}\sum_R\left [ v(P_i^R \cup \left \{ i \right \}) - v(P_i^R) \right ],</math>

where {{mvar|R}} is an ordering of the players and <math>P_i^R</math> is the set of players in {{mvar|N}} which precede {{mvar|i}} in the order {{mvar|R}}.

The following table displays the marginal contributions of Player 1.

:<math>
\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,3,2\}) - v(\{3,2\}) = 1 - 1 = 0
\end{array}
</math>

Observe
:<math>\varphi_1(v)= \!\left(\frac{1}{6}\right)(1)=\frac{1}{6}.</math>

By a symmetry argument it can be shown that
:<math>\varphi_2(v)=\varphi_1(v)=\frac{1}{6}.</math>

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

:<math>\varphi_3(v) = \frac{4}{6} = \frac{2}{3}.</math>

== Properties ==

The Shapley value has many desirable properties.
Notably, it is the only payment rule satisfying the four properties of Efficiency, Symmetry, Linearity and Null player (or dummy player).<ref name=":2">{{cite book|title=Contributions to the Theory of Games|last=Shapley|first=Lloyd S.|publisher=Princeton University Press|year=1953|isbn=9781400881970|editor-last=Kuhn|editor-first=H. W.|series=Annals of Mathematical Studies|volume=28|pages=307–317|chapter=A Value for n-person Games|doi=10.1515/9781400881970-018|editor2-first=A. W.|editor2-last=Tucker}}</ref>
See<ref name=":1" />{{Rp|147–156}} for more characterizations of the Shapley value.

=== 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:
:<math>\sum_{i\in N}\varphi_i(v) = v(N)</math>

''Proof'': <math>\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)</math>

since <math>\sum_{i\in N} v(P_i^R \cup \left \{ i \right \}) - v(P_i^R)</math> is a [[telescoping sum]] and there are <math>|N|!</math> different orderings <math>R</math>.

=== Symmetry ===
If <math>i</math> and <math>j</math> are two actors who are equivalent in the sense that

:<math>v(S\cup\{i\}) = v(S\cup\{j\})</math>
for every subset <math>S</math> of <math>N</math> which contains neither <math>i</math> nor <math>j</math>, then <math>\varphi_i(v) = \varphi_j(v)</math>.

This property is also called ''equal treatment of equals''.

=== Linearity ===
If two coalition games described by gain functions <math>v</math> and <math>w</math> are combined, then the distributed gains should correspond to the gains derived from <math>v</math> and the gains derived from <math>w</math>:

:<math>\varphi_i(v+w) = \varphi_i(v) + \varphi_i(w)</math>
for every <math>i</math> in&nbsp;<math>N</math>. Also, for any real number <math>a</math>,
:<math>\varphi_i(a v) = a \varphi_i(v)</math>
for every <math>i</math> in&nbsp;<math>N</math>.

=== Null player ===
The Shapley value <math>\varphi_i(v)</math> of a null player <math>i</math> in a game <math>v</math> is zero. A player <math>i</math> is ''null'' in <math>v</math> if <math>v(S\cup \{i\}) = v(S)</math> for all coalitions <math>S</math> that do not contain <math>i</math>.

=== Stand-alone test ===
If <math>v</math> is a [[subadditive set function]], i.e., <math>v(S\sqcup T) \leq v(S) + v(T)</math>, then for each agent <math>i</math>: <math>\varphi_i(v) \leq v(\{i\})</math>.

Similarly, if <math>v</math> is a [[superadditive set function]], i.e., <math>v(S\sqcup T) \geq v(S) + v(T)</math>, then for each agent <math>i</math>:  <math>\varphi_i(v) \geq v(\{i\})</math>.

So, if the cooperation has positive synergy, all agents (weakly) gain, and if it has negative synergy, all agents (weakly) lose.<ref name=":1">{{Cite Moulin 2004}}</ref>{{Rp|147–156}}

=== Anonymity ===
If <math>i</math> and <math>j</math> are two agents, and <math>w</math> is a gain function that is identical to <math>v</math> except that the roles of <math>i</math> and <math>j</math> have been exchanged, then <math>\varphi_i(v) = \varphi_j(w)</math>. 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 <math>i</math> as the arguments.

== 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 [[atom (measure theory)|non-atomic]] [[measure (mathematics)|measure]]), creating the diagonal formula.<ref name=":0">{{cite book |first1=Robert J. |last1=Aumann |first2=Lloyd S. |last2=Shapley |title=Values of Non-Atomic Games |publisher=Princeton Univ. Press |location=Princeton |year=1974 |isbn=0-691-08103-4 }}</ref> This was later extended by [[Jean-François Mertens]] and [[Abraham Neyman]].

As seen above, the value of an n-person game associates with each player the expectation of their contribution to the worth of the coalition of players before them 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 of as a good sample of all players. The value of a given infinitesimal player {{mvar|ds}} is then defined as "their" contribution to the worth of a "perfect" sample of all the players.

Symbolically, if {{mvar|v}} is the coalitional worth function that associates each coalition {{mvar|c}} with its value, and each coalition {{mvar|c}} is a measurable subset of the measurable set {{mvar|I}} of all players, that we assume to be <math>I=[0,1]</math> without loss of generality, the value <math>(Sv)(ds)</math> of an infinitesimal player {{mvar|ds}} in the game is

: <math>
(Sv)(ds) = \int_0^1 (\, v(tI + ds)- v(tI)\,)\,dt.
</math>

Here {{mvar|tI}} is a perfect sample of the all-player set {{mvar|I}} containing a proportion {{mvar|t}} of all the players, and <math>tI+ ds</math> is the coalition obtained after {{mvar|ds}} joins {{mvar|tI}}. This is the heuristic form of the diagonal formula.<ref name=":0" />

Assuming some regularity of the worth function, for example, assuming {{mvar|v}}  can be represented as differentiable function of a non-atomic measure on  {{mvar|I}}, {{mvar|&mu;}}, <math>v(c)=f(\mu(c))</math> with density function <math>\varphi</math>, with <math>\mu(c)=\int 1_c(u)\varphi(u)\,du,</math> where <math> 1_c(\bullet)</math> is the characteristic function of {{mvar|c}}. Under such conditions

: <math>\mu(tI)=t\mu(I)
</math>,

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

: <math>
v(tI + ds)=f(t\mu(I))+f'(t\mu(I))\mu(ds)
.</math>

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

: <math>
(Sv)(ds) = \int_0^1 f'_{t\mu(I)}(\mu(ds)) \, dt
</math>

Above {{mvar|&mu;}} can be vector valued (as long as the function is defined and differentiable on the range of {{mvar|&mu;}}, the above formula makes sense).

In the argument above if the measure contains atoms <math>\mu(tI)=t\mu(I)</math> 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 {{mvar|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):<ref>{{cite journal |last=Mertens |first=Jean-François |year=1980 |title=Values and Derivatives |journal=[[Mathematics of Operations Research]] |volume=5 |issue=4 |pages=523–552 |jstor=3689325 |doi=10.1287/moor.5.4.523}}</ref>

: <math>
(Sv)(ds) =  \lim_{\varepsilon \to 0, \varepsilon>0} \frac{1}{\varepsilon}\int_0^{1-\varepsilon} (f(t+\varepsilon \mu(ds))-f(t)) \, dt
</math>

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.<ref>{{cite journal |last=Mertens |first=Jean-François |year=1988 |title=The Shapley Value in the Non Differentiable Case |journal=International Journal of Game Theory |volume=17 |issue=1 |pages=1–65 |doi=10.1007/BF01240834 |s2cid=118017018 }}</ref> A survey for non atomic value is found in Neyman (2002)<ref>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.).[http://ratio.huji.ac.il/dp/neyman/values.pdf]</ref>

== Generalization to coalitions ==
The Shapley value only assigns values to the individual agents.  It has been generalized<ref>{{cite journal |last1=Grabisch |first1=Michel |last2=Roubens |first2=Marc |title=An axiomatic approach to the concept of interaction among players in cooperative games |journal=International Journal of Game Theory |date=1999 |volume=28 |issue=4 |pages=547–565 |doi=10.1007/s001820050125|s2cid=18033890 }}</ref> to apply to a group of agents ''C'' as,

: <math>
\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 ) \; .
</math>

In terms of the synergy function <math>w</math> above, this reads<ref name="Grabisch Representations"/><ref name="Grabisch Representations 2"/>

: <math>
\varphi_C(v) = \sum_{C \subseteq T \subseteq N} \frac{w(T)}{|T| - |C| + 1} </math>

where the sum goes over all subsets <math>T</math> of <math>N</math> that contain <math>C</math>.

This formula suggests the interpretation that the Shapley value of a coalition is to be thought of as the standard Shapley value of a single player, if the coalition <math>C</math> is treated like a single player.

== Value of a player to another player ==
The Shapley value <math>\varphi_i(v)</math> was decomposed by Hausken and Matthias<ref>{{cite journal |last1=Hausken |first1=Kjell |last2=Mohr |first2=Matthias |title=The Value of a Player in n-Person Games |journal=Social Choice and Welfare |date=2001 |volume=18 |issue=3 |pages=465–83 |doi=10.1007/s003550000070 |jstor=41060209 |s2cid=27089088 |url=http://www.jstor.org/stable/41060209|url-access=subscription }}</ref> into a matrix of values

: <math>
\varphi_{ij}(v) = \sum_{S \subseteq N} \frac{(|S| - 1)! \; (n - |S|)!}{n!} (v(S) - v(S \setminus \{i\}) - v(S \setminus \{j\}) + v(S \setminus \{i, j\})) \sum_{t=|S|}^n \frac{1}{t}
</math>

Each value <math>\varphi_{ij}(v) </math> represents the value of player <math>i</math> to player <math>j</math>. This matrix satisfies

: <math>
\varphi_i(v) = \sum_{j \in N} \varphi_{ij}(v)
</math>

i.e. the value of player <math>i</math> to the whole game is the sum of their value to all individual players.

In terms of the synergy <math>w</math> defined above, this reads

: <math>
\varphi_{ij}(v) = \sum_{\{i, j\} \subseteq S \subseteq N} \frac{w(S)}{|S|^2}
</math>

where the sum goes over all subsets <math>S</math> of <math>N</math> that contain <math>i</math> and <math>j</math>.

This can be interpreted as sum over all subsets that contain players <math>i</math> and <math>j</math>, where for each subset <math>S</math> you 
* take the synergy <math>w(S)</math> of that subset
* divide it by the number of players in the subset <math>|S|</math>. Interpret that as the surplus value player <math>i</math> gains from this coalition
* further divide this by <math>|S|</math> to get the part of player <math>i</math>'s value that's attributed to player <math>j</math>

In other words, the synergy value of each coalition is evenly divided among all <math>|S|^2</math> <em>pairs</em> <math>(i, j)</math> of players in that coalition, where <math>i</math> generates surplus for <math>j</math>.

== Shapley value regression==
Shapley value regression is a statistical method used to measure the contribution of individual predictors in a regression model. In this context, the "players" are the individual predictors or variables in the model, and the "gain" is the total explained variance or predictive power of the model. This method ensures a fair distribution of the total gain among the predictors, attributing each predictor a value representing its contribution to the model's performance. Lipovetsky (2006) discussed the use of Shapley value in regression analysis, providing a comprehensive overview of its theoretical underpinnings and practical applications.<ref>{{cite journal |vauthors=Lipovetsky S |title=Shapley value regression: A method for explaining the contributions of individual predictors to a regression model |journal=Linear Algebra and Its Applications |year=2006 |volume=417 |pages=48–54 |doi=10.1016/j.laa.2006.04.027|doi-broken-date=1 November 2024 }}</ref>

Shapley value contributions are recognized for their balance of stability and discriminating power, which make them suitable for accurately measuring the importance of service attributes in market research.<ref>{{cite journal |vauthors=Pokryshevskaya E, Antipov E |title=A comparison of methods used to measure the importance of service attributes |journal=International Journal of Market Research |year=2014 |volume=56 |issue=3 |pages=283–296 |doi=10.2501/IJMR-2014-023}}</ref> Several studies have applied Shapley value regression to key drivers analysis in marketing research. Pokryshevskaya and Antipov (2012) utilized this method to analyze online customers' repeat purchase intentions, demonstrating its effectiveness in understanding consumer behavior.<ref>{{cite journal |vauthors=Pokryshevskaya EB, Antipov EA |title=The strategic analysis of online customers' repeat purchase intentions |journal=Journal of Targeting, Measurement and Analysis for Marketing |year=2012 |volume=20 |pages=203–211 |doi=10.1057/jt.2012.13}}</ref> Similarly, Antipov and Pokryshevskaya (2014) applied Shapley value regression to explain differences in recommendation rates for hotels in South Cyprus, highlighting its utility in the hospitality industry.<ref>{{cite journal |vauthors=Antipov EA, Pokryshevskaya EB |title=Explaining differences in recommendation rates: the case of South Cyprus hotels |journal=Economics Bulletin |year=2014 |volume=34 |issue=4 |pages=2368–2376}}</ref> Further validation of the benefits of Shapley value in key-driver analysis is provided by Vriens, Vidden, and Bosch (2021), who underscored its advantages in applied marketing analytics.<ref>{{cite journal |vauthors=Vriens M, Vidden C, Bosch N |title=The benefits of Shapley-value in key-driver analysis |journal=Applied Marketing Analytics |year=2021 |volume=6 |issue=3 |pages=269–278}}</ref>

== 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 <ref name="Lundberg Lee pp. 4765–4774">{{cite journal | last1=Lundberg | first1=Scott M. | last2=Lee | first2=Su-In|author2-link=Su-In Lee | title=A Unified Approach to Interpreting Model Predictions | journal=Advances in Neural Information Processing Systems | year=2017 | volume=30 | pages=4765–4774 | arxiv=1705.07874 | url=https://papers.nips.cc/paper/2017/hash/8a20a8621978632d76c43dfd28b67767-Abstract.html | access-date=2021-01-30}}</ref> or contribute to the uncertainty of a prediction.<ref name= "Watson et al">{{cite journal | last1=Watson| first1=David | last2=O’Hara | first2=Joshua | last3=Tax | first3=Niek | last4=Mudd | first4=Richard | last5=Guy | first5=Ido | title= Explaining Predictive Uncertainty with Information Theoretic Shapley | journal=Advances in Neural Information Processing Systems | year=2023 | volume=37 | arxiv= 2306.05724 }}</ref> This unifies several other methods including Locally Interpretable Model-Agnostic Explanations (LIME),<ref name="Ribeiro Singh Guestrin p. ">{{cite conference | last1=Ribeiro | first1=Marco Tulio | last2=Singh | first2=Sameer | last3=Guestrin | first3=Carlos | title=Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining | chapter="Why Should I Trust You?" | publisher=ACM | publication-place=New York, NY, USA | date=2016-08-13 | pages=1135–1144 | isbn=978-1-4503-4232-2 | doi=10.1145/2939672.2939778 }}</ref> DeepLIFT,<ref name="Shrikumar Greenside Kundaje 2017 pp. 3145–3153">{{cite journal | last1=Shrikumar | first1=Avanti | last2=Greenside | first2=Peyton | last3=Kundaje | first3=Anshul | title=Learning Important Features Through Propagating Activation Differences | website=PMLR | date=2017-07-17 | issn=2640-3498 | url=http://proceedings.mlr.press/v70/shrikumar17a.html | access-date=2021-01-30 | pages=3145–3153}}</ref> and Layer-Wise Relevance Propagation.<ref name="Bach Binder Montavon Klauschen p=e0130140">{{cite journal | last1=Bach | first1=Sebastian | last2=Binder | first2=Alexander | last3=Montavon | first3=Grégoire | last4=Klauschen | first4=Frederick | last5=Müller | first5=Klaus-Robert | author-link5=Klaus-Robert Müller | last6=Samek | first6=Wojciech | editor-last=Suarez | editor-first=Oscar Deniz | title=On Pixel-Wise Explanations for Non-Linear Classifier Decisions by Layer-Wise Relevance Propagation | journal=PLOS ONE | publisher=Public Library of Science (PLoS) | volume=10 | issue=7 | date=2015-07-10 | issn=1932-6203 | doi=10.1371/journal.pone.0130140 | page=e0130140| pmid=26161953 | pmc=4498753 | bibcode=2015PLoSO..1030140B | doi-access=free }}</ref><ref>{{cite journal |last1=Antipov |first1=E. A. |last2=Pokryshevskaya |first2=E. B. |year=2020 |title=Interpretable machine learning for demand modeling with high-dimensional data using Gradient Boosting Machines and Shapley values |journal=Journal of Revenue and Pricing Management |volume=19 |issue=5 |pages=355–364|doi=10.1057/s41272-020-00236-4 }}</ref> 

Distributional values are an extension of the Shapley value and related value operators designed to preserve the probabilistic output of predictive models in machine learning, including neural network classifiers and large language models.<ref>{{cite journal |vauthors=Franceschi L, Donini M, Archambeau C, Seeger M |title=Explaining probabilistic models with distributional values |journal=Proceedings of the 41st International Conference on Machine Learning (ICML 2024) |year=2024 |volume= |issue= |pages= |arxiv=2402.09947 |url=https://arxiv.org/pdf/2402.09947}}</ref>

The statistical understanding of Shapley values remains an ongoing research question. A smooth version, called Shapley curves,<ref>{{Cite journal |last=Miftachov |first=Ratmir |last2=Keilbar |first2=Georg |last3=Härdle |first3=Wolfgang |year=2024 |title=Shapley Curves: A Smoothing Perspective |url=https://www.tandfonline.com/doi/full/10.1080/07350015.2024.2365781 |journal=Journal of Business & Economic Statistics}}</ref> achieves the minimax rate and is shown to be asymptotically Gaussian in a nonparametric setting. Confidence intervals for finite samples can be obtained via the wild bootstrap.

== See also ==
* [[Airport problem]]
* [[Banzhaf power index]]
* [[Shapley–Shubik power index]]

== References ==
{{Reflist|30em}}

== Further reading ==
* {{cite book |first=James W. |last=Friedman |title=Game Theory with Applications to Economics |location=New York |publisher=Oxford University Press |year=1986 |isbn=0-19-503660-3 |pages=[https://archive.org/details/gametheorywithap0000frie/page/209 209]–215 |url=https://archive.org/details/gametheorywithap0000frie |url-access=registration }}

== External links ==
* {{springer|title=Shapley value|id=p/s084780}}
* [http://shapleyvalue.com/ Shapley Value Calculator]
* [https://www.youtube.com/watch?v=aThG4YAFErw Calculating a Taxi Fare using the Shapley Value]

{{game theory}}

[[Category:Cooperative games]]
[[Category:Fair division]]
[[Category:Lloyd Shapley]]