We consider a cost sharing problem among agents on a line. The problem is closely related to the classic airport game, but in our model agents are characterized by their location, rather than their needed runway length. We characterize a family of cost allocation rules in which agents pay a...

The increasing serial cost sharing rule of Moulin and Shenker [Econometrica 60 (1992) 1009] and the decreasing serial rule of de Frutos [Journal of Economic Theory 79 (1998) 245] have attracted attention due to their intuitive appeal and striking incentive properties. An axiomatic...

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...

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...