A new concept of consistency for cost sharing solutions is discussed, analyzed, and related to the homonymous property within the rationing context. The class of additive and consistent mechanisms is isomorphic to the class of consistent and monotonic rationing methods. Consequently average and...

This paper provides a first insight into cost sharing rules for the continuous knapsack problem. Assuming a set of divisible items with weights from which a knapsack with a certain weight constraint is to be filled, different such (classes of) rules are discussed. Those - based on individual...

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