The degree and cost adjusted folk solution for minimum cost spanning tree games

In this paper two cost sharing solutions for minimum cost spanning tree problems are introduced, the degree adjusted folk solution and the cost adjusted folk solution. These solutions overcome the problem of the classical reductionist folk solution as they have considerable strict ranking power, without breaking established axioms. As such they provide an affirmative answer to an open question, put forward in Bogomolnaia and Moulin(2010).