The folk solution and Boruvkas algorithm in minimum cost spanning tree problems
Boruvkas algorithm, which computes a minimum cost spanning tree, is used to define a rule to share the cost among the nodes (agents). We show that this rule coincides with the folk solution, a very well-known rule of this literature.
folk solution boruvkas algorithm minimum cost spanning tree