In this paper we consider the Minimum Cost Spanning Tree model. We assume that a central planner aims at implementing … the minimum cost spanning tree not knowing the true link costs. The central planner sets up a game where agents announce …

The Boruvka's algorithm, which computes the minimum cost spanning tree, is used to define a rule to share the cost …

We consider four cost allocation rules in minimum cost spanning tree problems. These rules were introduced by Bird …

if, the dual game of the cost game has a large core. Using this result, we investigate minimum cost spanning tree games … minimum cost spanning tree game with revenues has a nonempty core. Furthermore, we provide an example of a minimum cost … spanning tree game with revenues with an empty core where every connection cost can take only one of three values (low, medium …

Minimum cost spanning tree problems connect agents efficiently to a source with the cost of using an edge fixed. We …

We consider an extension of minimum cost spanning tree (mcst) problems in which some agents do not need to be connected …