Shapley value

from Wikipedia, the free encyclopedia

The Shapley value (named after Lloyd Shapley ) is a point-worthy solution concept from cooperative game theory . It indicates which payout the players can expect (positive interpretation) or should receive (normative interpretation) depending on a coalition function.

example

Given are three players who are identified by the abbreviations and , i.e. H. , and which can achieve the following values:

This means, for example , that the “coalition” consisting of players alone can achieve the value ; means that a coalition of players can work together to create value ; because of this, all players can create value together .

The Shapley value is used to divide the value . The following procedure can be used to determine the Shapley score of a player : Note all the orders in which the players can be arranged. For each order you determine the value of the coalition, which consists of those players who are listed in front of the player in question. The value that this coalition has together with the player is noted and the difference is formed, i.e. the so-called marginal contribution of the player in the order under consideration. Finally, you take the average of these marginal contributions and get the player's Shapley score . The following table reflects these considerations for gamers :

sequence Player before b Player in front of b plus b marginal contribution from player b

The average of the marginal contributions gives the Shapley value for players

The Shapley values ​​of the players and and are obtained in the same way

      and      

general definition

Given is a cooperative game with transferable benefits, that is, given

  • a finite set of players with elements and
  • a coalition function that assigns a real number to each subset of and, in particular, gives the empty coalition the value :

where denotes the power set of , i.e. the set of all subsets. A subset of the players is called a coalition. The expression is called the value of the coalition .

The Shapley value now assigns a payout for the game to each player . There are different formulas that lead to the same result.

Order definition

First, the marginal contribution of a player for a given order of players is defined. Be an order of the player set with the interpretation that player is listed at position in . For a player listed before Player in , applies . So the predecessors of in are in the crowd

.

If the players are added one after the other to a coalition according to the order, the player makes the following marginal contribution :

.

A player's Shapley score is calculated as the average of the marginal contributions over all possible orders:

where denotes the set of all possible orders of the players.

Note: The above example is calculated according to this definition. For is z. B. and

Subset definition

The marginal contribution of a player at any given coalition is

A player's Shapley score is calculated as the weighted mean of the marginal contributions to all possible coalitions:

Based on the sequence definition of the Shapley value, this formula can now be understood as follows: For each there is

Orders, so that applies, because there are possibilities to arrange the players from in front of the player and possibilities to arrange the players from behind the player (see also multinomial coefficients ).

example

Look again at the above example and take the case . It is then exactly for the two sequences and . So it applies . Instead of going through all the sequences, you could also set up the following table:

coalition frequency marginal contribution

The average of the marginal contributions gives the Shapley value for games in the crowd

Definition via Harsanyi dividends

Another calculation option also provides a better insight into the structure of a coalition function.

Harsanyi dividends

The following argument is often attributed to John Harsanyi . Look at a coalition and its worth . What proportion of is actually created by the combination of all members , and not by the combination of the subgroups contained in? That is, what part of is not already due to the achievement of some subgroup? The answer is recursive. First of all, the real performance of an empty coalition is nothing . The other actual services result recursively as the value of a coalition minus the services that are already provided by the coalitions contained:

These expressions are known as the Harsanyi dividends. Note: Instead of just write or just write .

example

Look again at the above example and see that it is actually being performed by the player . So the actual performance from the player alone is . The genuine achievements of the other individual coalitions can be determined in the same way,

.

For the coalition , the services already provided by the included coalitions must now be deducted:

.

The following apply analogously:

Shapley value as shared Harsanyi dividends

A coalition's Harsanyi dividend is paid when all the players are present. So it is plausible to split this performance equally among all the players in the coalition. This gives another formula for the Shapley value:

example

Look again at the example above with the number of players and notice that there are players in the coalitions

is included. Hence he gets

characterization

The Shapley value is the only payoff function that satisfies the following four axioms:

  • Pareto efficiency: the value of the grand coalition is shared among the players.
  • Symmetry: Players with the same marginal contribution get the same.
  • Zero Player: A player with a marginal zero contribution to any coalition receives zero.
  • Additivity: If the game can be broken down into two independent games, then each player's payout in the composite game is the sum of the payouts in the split games.

literature

  • Lloyd S. Shapley: A Value for n-person Games . In: HW Kuhn and AW Tucker (Eds.): Contributions to the Theory of Games, volume II. (Annals of Mathematics Studies v. 28), Princeton University Press, Princeton 1953, ISBN 0-691-07935-8 , pp. 307-317.
  • Harald Wiese: Cooperative game theory . Oldenbourg, Munich 2005, ISBN 3-486-57745-X .