Skip to main content icon/video/no-internet

The Shapley value (ɸ) is one of the best known solution concepts of cooperative game theory. It supplies a reasonable expectation of the share-out of the global winnings among players and a fair division in normative contexts. This value was introduced by Lloyd Stowell Shapley in 1953 for superadditive n-person cooperative games in characteristic function form. It was a decisive contribution to cooperative game theory because the previous approaches did not guarantee (as the Shapley value did) existence and uniqueness of a solution. Shapley abandoned the previous methods based on dominance in favor of a particular model of bargaining, and the solution was characterized by a system of axioms. A 1954 work by Shapley and Martin Shubik applied the Shapley value to the special case of simple games, thereby introducing the Shapley-Shubik power index, which became a basic concept in voting game theory. Since 1953 other values have been proposed along the lines introduced by Shapley but based on different bargaining models and/or sets of axioms.

In what follows, definitions will be introduced, the axioms will be illustrated, and the formula for the Shapley value will be presented and clarified with an illustrative example. Using the same example, the bargaining model that leads to that value will be explained. Further developments in relevant research will be briefly noted.

Definitions

Let N={1,2, …, n} be a set of players. A cooperative game v on N is expressed in characteristic function form if a function v: 2NR (the characteristic function) is given, which assigns a value v(S) to each coalition S ⫅ N where v) = 0. A game is superadditive if v(S ∪ T) ≥ v (S) + v (T) for all disjoint coalitions S, T of N.

Axioms

The Shapley value ɸi for player i is based on four axioms. (In his original presentation, Shapley merged the first and third axioms into a single carrier axiom.)

  • Efficiency: all resources available to the whole coalition N are distributed among the players (i.e., Ʃ ɸi(v)=v(N)).
  • Symmetry: if players i and j have symmetrical roles in v, then φi = φj. (For example, if we transform the game v into the game v' where the only change is that player 1 assumes the label “2” and player 2 assumes the label “1,” then φ1(v) = φ2(v') and φ2(v) = φ1(v').)
  • Dummy player: if a player i does not bring any contribution to any coalition S ⫅ N (i.e., player i is a dummy player), then φi(v)= 0.
  • Additivity: if a game is the “sum” of two games, v' and v, defined on the same player set N, the win for each player i in the cumulative game is the sum of the winnings achieved by him or her in the two separate games:

φi(v' + v”)= φi(v)+ φi(v”) for all players i ɛ N.

Formula

It can be demonstrated that a unique function exists that respects the four axioms listed above. This function, the Shapley value, is:

None

for all i ɛ N, where s is the number of members in the coalition S.

The formula assigns each player i the sum of the contributions v(S) - v(S\{i}) made by him to all possible coalitions S ⫅ N, each multiplied by the coefficient None, where n! = 1, 2, …, <>

...

  • Loading...
locked icon

Sign in to access this content

Get a 30 day FREE TRIAL

  • Watch videos from a variety of sources bringing classroom topics to life
  • Read modern, diverse business cases
  • Explore hundreds of books and reference titles

Sage Recommends

We found other relevant content for you on other Sage platforms.

Loading