This article proposes a setting that allows for technological cooperation in the cost sharing model. Dealing with discrete demands, we study two properties: additivity and dummy. We show that these properties are insufficient to guarantee a unit-flow representation similar to that of Wang (Econ...

We reconsider the following cost-sharing problem: agent i = 1,...,n demands a quantity xi of good i; the corresponding total cost C(x1,...,xn) must be shared among the n agents. The Aumann-Shapley prices (p1,...,pn) are given by the Shapley value of the game where each unit of each good is...

We offer an axiomatization of the serial cost-sharing method of Friedman and Moulin (1999). The key property in our axiom system is Group Demand Monotonicity, asking that when a group of agents raise their demands, not all of them should pay less.