Suppose that a group have demands for some good. Each one of them owns a technology to produce the good, with these technologies varying in their effectiveness. We consider technologies exhibiting either increasing return to scale (IRS) or decreasing returns to scale (DRS). In each case, we...

In the discrete cost sharing model with technological cooperation (Bahel and Trudeau (IJGT, 2013)), 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 affect the cost shares, is used...

Minimum cost spanning tree problems connect agents efficiently to a source with the cost of using an edge fixed. We revisit the dispute between the Kar and folk solutions, two solution concepts to divide the common cost of connection based on the Shapley value. We introduce a property called...

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

We consider an extension of minimum cost spanning tree (mcst) problems where some agents do not need to be connected to the source, but might reduce the cost of others to do so. Even if the cost usually cannot be computed in polynomial time, we extend the characterization of the Kar solution...