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

In the discrete cost sharing model with technological cooperation (Bahel and Trudeau in Int J Game Theory 42:439–460, <CitationRef CitationID="CR1">2013a</CitationRef>), we study the implications of a number of properties that strengthen the well-known dummy axiom. Our main axiom, which requires that costless units of demands do not...</citationref>

For the class of shortest path games, we propose a family of new cost sharing rules satisfying core selection. These rules allocate shares according to some lexicographic preference relation. A computational procedure is provided. Our results relate to those of Tijs et al. (2011).