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

Minimum cost spanning tree problems
Spanning tree
Cost sharing
Ranking
Axioms
Costs

Keywords

  • Cost sharing, Minimum cost spanning tree games, Networks

Cite this

@article{7a50e3dacc984d0cb54f1dd871faa1d7,
title = "The degree and cost adjusted folk solution for minimum cost spanning tree games",
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).",
keywords = "Cost sharing, Minimum cost spanning tree games, Networks",
author = "Henk Norde",
year = "2019",
month = "1",
doi = "10.1016/j.geb.2018.08.002",
language = "English",
volume = "113",
pages = "734--742",
journal = "Games and Economic Behavior",
issn = "0899-8256",
publisher = "Academic Press Inc.",

}

The degree and cost adjusted folk solution for minimum cost spanning tree games. / Norde, Henk.

In: Games and Economic Behavior, Vol. 113, 01.2019, p. 734-742.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

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

AU - Norde, Henk

PY - 2019/1

Y1 - 2019/1

N2 - 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).

AB - 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).

KW - Cost sharing, Minimum cost spanning tree games, Networks

U2 - 10.1016/j.geb.2018.08.002

DO - 10.1016/j.geb.2018.08.002

M3 - Article

VL - 113

SP - 734

EP - 742

JO - Games and Economic Behavior

JF - Games and Economic Behavior

SN - 0899-8256

ER -