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

Research output: Contribution to journalArticleScientificpeer-review

Abstract

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).
Original languageEnglish
Pages (from-to)734-742
JournalGames and Economic Behavior
Volume113
DOIs
Publication statusPublished - Jan 2019

    Fingerprint

Keywords

  • Cost sharing, Minimum cost spanning tree games, Networks

Cite this