Coalition (game theory) 2026-10-06
A coalition is a subset of the players in a transferable utility game, considered as a group that can act together. The game assigns it value . The core of a cooperative game constrains the total payoff assigned to every coalition, while a marginal contribution measures the value gained by adding one player.
Convex cooperative game 2026-10-06
A transferable utility game is convex when its coalition-value function is supermodular. Equivalently a player's marginal contribution cannot decrease when the preceding coalition grows. The implication follows by applying the displayed inequality to and with , ; the reverse implication follows by adding successive marginal inequalities. This property concerns coalition values, not geometrical convexity of a strategy space.
Cooperative game theory 2026-10-06
Cooperative game theory studies what groups of players can achieve together and how their joint value can be allocated. A transferable utility game assigns a real value to each coalition. The core of a cooperative game asks which allocations no coalition can improve upon; the Shapley value averages marginal contributions across player orderings.
Marginal contribution 2026-10-06
A player's marginal contribution to a coalition is the increase in its value when that player joins. In a convex cooperative game, marginal contributions increase with the preceding coalition. Averaging contributions across player orderings gives the Shapley value.
For a player ordering , is the set before player , and the displayed entries form its marginal contribution vector. Their sum is . The Shapley value is the average of these vectors. In a convex cooperative game, increasing marginal contributions make each such vector satisfy every coalition constraint of the core of a cooperative game.
True, with the usual normalization . For a convex cooperative game, the supermodular inequality implies increasing marginal contributions: if and , apply it to and to obtain
Fix an ordering and let be the set of players before . Its marginal contribution vector is . Summing in order telescopes to . For any coalition , , so increasing marginals give
These are exactly the efficiency and coalition constraints of the core of a cooperative game. Thus every marginal contribution vector is in the core. The core is a convex set, being an intersection of linear half-spaces and an efficiency hyperplane. The Shapley value is the average of the marginal contribution vectors over all orderings, so it too lies in the core. This proves Shapley value belongs to the core of a convex game, without needing a separate existence theorem for the core.
Shapley value 2026-10-06
The Shapley value averages each player's marginal contribution over uniformly random player orderings. Exactly orderings have immediately before player , giving the formula. The values sum to by telescoping each ordering. In a simple cooperative game this is the probability of being pivotal. For a convex cooperative game, Shapley value belongs to the core of a convex game guarantees a stable allocation as well.
Increasing marginal contributions imply for . Summing telescopes to , while efficiency follows by telescoping over the full ordering. Hence every marginal contribution vector is in the core of a cooperative game. The core is a convex set, so their average, the Shapley value, is in it too. This gives an elementary proof of nonemptiness and stability for a convex cooperative game.
Transferable utility game 2026-10-06
A finite transferable utility game gives each coalition a real value that its members can distribute among themselves. The usual normalization is . An efficient payoff vector satisfies . Simple cooperative games model winning coalitions with values zero and one; convex cooperative games model increasing marginal contributions.