We provide several new characterizations of well known cost sharing methods (CSMs) as maxima of linear (or convex) functionals. For the Shapley-Shubik method the characterization has an interpretation in terms of randomly ordered agents choosing their most preferred CSM, while the...

Using a new representation theorem for additive cost sharing methods as sums of path methods, we show that many of the standard additive cost sharing methods (Aumann-Shapley, Shapley Shubik, and Serial Cost) are consistent. These results follow directly from a simple sufficient condition for...

We consider three new axioms for surplus sharing problems. The first is strong monotonicity which says that workers should be rewarded for increases in productivity and the second says that productive workers should receive some compensation. The third requires that the surplus sharing rule...