Econometrica: Sep 1992, Volume 60, Issue 5

Serial Cost Sharing<1009:SCS>2.0.CO;2-U
p. 1009-1037

Herve Moulin, Scott Shenker

A fixed group of $n$ agents share a one input, one output technology with decreasing returns. We propose the following cost sharing formula. Agent 1 with the lowest demand of output $q_1$ pays $(1/n)$th of the cost of $nq_1$. Agent 2, with the next lowest demand $q_2$ pays agent 1's cost share plus $1/(n - 1)$th of the incremental cost from $nq_1$ to $(n - 1)q_2 + q_1$. Agent 3, with the next lowest demand $q_3$ pays agent 2's cost share, plus $1/(n - 2)$th of the incremental cost from $(n - 1)q_2 + q_1$ to $(n - 2)q_3 + q_2 + q_1$. And so on. Among agents endowed with convex and monotonic preferences, serial cost sharing is dominance solvable and its unique equilibrium is also robust to coalitional deviations. We show that no other smooth cost sharing mechanism yields a unique Nash equilibrium at all preference profiles.

Log In To View Full Content