We consider an extension of minimum cost spanning tree (mcst) problems in which 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...

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

Minimum cost spanning tree (mcst) problems try to connect agents efficiently to a source when agents are located at different points in space and the cost of using an edge is fixed. We introduce a new cost sharing solution that always selects a point in the core and that is more responsive to...