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>

Minimum cost spanning tree problems connect agents efficiently to a source when agents are located at different points and the cost of using an edge is fixed. The folk and cycle-complete cost sharing solutions always offer core allocations. We provide similar characterizations for both. A new...