Shapley value axioms (source code)

= Shapley value axioms
{c}

<Cooperative-game efficiency>, <cooperative-game symmetry>, the <null player> axiom and <cooperative-game additivity> characterize the <Shapley value>. The ordering-average definition satisfies all four: marginal totals telescope, relabelling players preserves the ordering average, zero marginals average to zero and marginal contributions add pointwise. The original work gives an equivalent axiomatization combining some of these requirements.<A Value for N-Person Games by Lloyd Shapley (RAND paper)>[RAND P-295, 1952, abstract: a value deduced from three axioms]{ref}

For uniqueness, write $u_T$ for the <unanimity game> of a nonempty <coalition> $T$. Recursively define $a_T=v(T)-\sum_{\varnothing\ne R\subsetneq T}a_R$ in increasing order of $|T|$. Then $v(S)=\sum_{\varnothing\ne T\subseteq S}a_T$, so $v=\sum_{\varnothing\ne T\subseteq N}a_Tu_T$. Apply the axioms to every scaled <unanimity game> $a_Tu_T$. Players outside $T$ receive zero; <cooperative-game symmetry> and <cooperative-game efficiency> give each player inside $T$ the amount $a_T/|T|$. Every game is a finite <sum> of such scaled <unanimity games>, and <cooperative-game additivity> therefore determines every allocation uniquely. Applying the axioms directly to the scaled games avoids assuming real homogeneity from additivity alone.