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 cost sharing model with technological cooperation, we investigate the implications of a number of consistency requirements. In a context where the enforcing authority cannot prevent agents from splitting or merging their demands (in order to reduce their cost shares), the methods used...

For the class of shortest path games, we propose a family of new cost sharing rules satisfying core selection. These rules allocate cost shares to the players according to some lexicographic preference relation. The average of all such lexicographic rules is shown to satisfy many desirable...

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

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

This paper 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 insuffcient to guarantee a unit-flow representation similar to that of Wang (1999)....

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

A review of the literature on cost sharing solutions for the minimum cost spanning tree problem is proposed, with a particular focus on the folk and Kar solutions. We compare the characterizations proposed, helped by some equivalencies between sets of properties.

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

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