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

Henk Norde

doi:10.1016/j.geb.2018.08.002

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

Henk Norde

Research output: Contribution to journal › Article › Scientific › peer-review

8 Citations (Scopus)

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 language	English
Pages (from-to)	734-742
Journal	Games and Economic Behavior
Volume	113
DOIs	https://doi.org/10.1016/j.geb.2018.08.002
Publication status	Published - Jan 2019

Keywords

Cost sharing, Minimum cost spanning tree games, Networks

Access to Document

10.1016/j.geb.2018.08.002

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 = jan,

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.",

}

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

SN - 0899-8256

VL - 113

SP - 734

EP - 742

JO - Games and Economic Behavior

JF - Games and Economic Behavior

ER -

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

Abstract

Keywords

Access to Document

Fingerprint

Cite this