The Boruvka's algorithm, which computes the 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.minimum cost spanning tree; Boruvka's algorithm; folk solution

Bergantiños, Gustavo

Vidal-Puga, Juan

English

Research Papers in Economics

A fair rule in minimum cost spanning tree problems.

A non-cooperative approach to the cost spanning tree problem.

Additivity in minimum cost spanning tree problems.

Cost monotonicity, consistency and minimum cost spanning tree games.

Minimum cost arborescences. Mimeo

Minimum cost spanning tree games and population monotonic allocation schemes.

Non cooperative cost spanning tree problems with budget restrictions.

O jistem problemu minimalnim (About a certain minimal problem) (in

On cost allocation for a spanning tree: A game theoretic approach.

On the irreducible core and the equal remaining obligation rule of minimum cost extension problems. Mimeo

On the shortest spanning subtree of a graph and the traveling salesman problem.

Optimal equilibria in the non-cooperative game associated with cost spanning tree problems.

Sharing the cost of a capacity network. Mimeo

Sharing the cost of a minimal cost spanning tree: beyond the folk solution. Mimeo

Shortest connection networks and some generalizations.

The family of cost monotonic and cost additive rules in minimum cost spanning tree problems. Mimeo

The optimistic TU game in minimum cost spanning tree problems.

The P-value for cost sharing in minimum cost spanning tree situations.

The folk solution and Boruvka's algorithm in minimum cost spanning tree problems

The folk solution and Boruvka's algorithm in minimum cost spanning tree problems

Abstract

Similar works

Full text

Available Versions

Research Papers in Economics