Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 35 6 Solution Created 2026-10-03 Updated 2026-10-14
The characteristic function of a coalitional game assigns each coalition its total attainable transferable payoff , with . In a transferable utility game the members may divide that total among themselves. This game-theoretic characteristic function is not the characteristic function of a probability distribution.
The Shapley value assigns to player the average marginal contribution that player makes over all uniformly random orderings of the players. If is the predecessor set in ordering , thenFor any ordering, summing all contributions telescopes to , so the Shapley value is efficient. It treats interchangeable players equally, pays a null player zero, and is additive in the characteristic function. These properties give its standard fairness axioms and uniquely characterize the Shapley value. The random-order interpretation explains why every position and predecessor coalition receives a principled weight rather than privileging a particular bargaining order.
For a convex cooperative game, couple a uniform ordering of with its restriction to . The restricted ordering is uniform on . For , the restricted predecessor set is , so increasing marginal contributions giveAveraging proves Shapley population monotonicity in a convex game:The comparison is meaningful for players who participate in the restricted game; no restricted value is defined for a player outside . Summing over and applying efficiency in that restricted game givesTogether with efficiency for , these are exactly the core of a cooperative game inequalities. Hence the Shapley value belongs to the core of a convex game. This proves the requested stability, not just individual rationality.
Now label the entrepreneur by and the workers by . A coalition without the entrepreneur has value zero; one containing the entrepreneur and workers has value . Workers are interchangeable, so their Shapley values agree. Fix one worker. Their contribution is zero if the entrepreneur appears after them. If the entrepreneur and exactly of the other workers appear before them, it is . For a fixed choice of those workers, the predecessors can be ordered in ways and the remaining successors in ways. Therefore the probability of this event, summing over the predecessor choices, isThe fair wage is thusThis is Shapley wages in an entrepreneur-worker game. The entrepreneur's payoff, by efficiency, isIt also follows directly because the entrepreneur has each possible number of predecessors with probability , and their contribution is then . When , the differences are all and , so
Finally suppose is convex and nondecreasing on nonnegative integers, so is nonnegative and nondecreasing. We verify that the entire coalitional game is convex. The entrepreneur's contribution to a set of workers is , which increases with that set. A worker's contribution is zero when the entrepreneur is absent and is when the entrepreneur and other workers are present. Enlarging a predecessor set either leaves both contributions zero, introduces the entrepreneur and a nonnegative contribution, or increases and hence . Every player's marginal contributions therefore increase, giving a convex cooperative game. The result already proved yields the complete Shapley allocation lies in the core, including the entrepreneur's payoff.
One can also verify the core inequalities directly. Nonentrepreneur coalitions receive , their value. For a coalition containing the entrepreneur and workers, it suffices thatSince in the wage sum, . Nondecreasing makes this full average no greater than the average of the final differences, which is the displayed right side. Thus ; the grand coalition has equality by efficiency. This confirms the core conclusion without assuming .