Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes

H.W. Norde, S. Moretti, S.H. Tijs

Research output: Working paperDiscussion paperOther research output

472 Downloads (Pure)

Abstract

In this paper we present the Subtraction Algorithm that computes for every classical minimum cost spanning tree game a population monotonic allocation scheme.As a basis for this algorithm serves a decomposition theorem that shows that every minimum cost spanning tree game can be written as nonnegative combination of minimum cost spanning tree games corresponding to 0-1 cost functions.It turns out that the Subtraction Algorithm is closely related to the famous algorithm of Kruskal for the determination of minimum cost spanning trees.For variants of the classical minimum cost spanning tree games we show that population monotonic allocation schemes do not necessarily exist.
Original languageEnglish
Place of PublicationTilburg
PublisherMicroeconomics
Number of pages21
Volume2001-18
Publication statusPublished - 2001

Publication series

NameCentER Discussion Paper
Volume2001-18

Fingerprint

Costs
Cost functions
Decomposition

Keywords

  • operational research
  • cost allocation
  • game theory

Cite this

Norde, H. W., Moretti, S., & Tijs, S. H. (2001). Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes. (CentER Discussion Paper; Vol. 2001-18). Tilburg: Microeconomics.
Norde, H.W. ; Moretti, S. ; Tijs, S.H. / Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes. Tilburg : Microeconomics, 2001. (CentER Discussion Paper).
@techreport{794e124d6be4494da14f4c1b5ede7e4d,
title = "Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes",
abstract = "In this paper we present the Subtraction Algorithm that computes for every classical minimum cost spanning tree game a population monotonic allocation scheme.As a basis for this algorithm serves a decomposition theorem that shows that every minimum cost spanning tree game can be written as nonnegative combination of minimum cost spanning tree games corresponding to 0-1 cost functions.It turns out that the Subtraction Algorithm is closely related to the famous algorithm of Kruskal for the determination of minimum cost spanning trees.For variants of the classical minimum cost spanning tree games we show that population monotonic allocation schemes do not necessarily exist.",
keywords = "operational research, cost allocation, game theory",
author = "H.W. Norde and S. Moretti and S.H. Tijs",
note = "Pagination: 21",
year = "2001",
language = "English",
volume = "2001-18",
series = "CentER Discussion Paper",
publisher = "Microeconomics",
type = "WorkingPaper",
institution = "Microeconomics",

}

Norde, HW, Moretti, S & Tijs, SH 2001 'Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes' CentER Discussion Paper, vol. 2001-18, Microeconomics, Tilburg.

Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes. / Norde, H.W.; Moretti, S.; Tijs, S.H.

Tilburg : Microeconomics, 2001. (CentER Discussion Paper; Vol. 2001-18).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes

AU - Norde, H.W.

AU - Moretti, S.

AU - Tijs, S.H.

N1 - Pagination: 21

PY - 2001

Y1 - 2001

N2 - In this paper we present the Subtraction Algorithm that computes for every classical minimum cost spanning tree game a population monotonic allocation scheme.As a basis for this algorithm serves a decomposition theorem that shows that every minimum cost spanning tree game can be written as nonnegative combination of minimum cost spanning tree games corresponding to 0-1 cost functions.It turns out that the Subtraction Algorithm is closely related to the famous algorithm of Kruskal for the determination of minimum cost spanning trees.For variants of the classical minimum cost spanning tree games we show that population monotonic allocation schemes do not necessarily exist.

AB - In this paper we present the Subtraction Algorithm that computes for every classical minimum cost spanning tree game a population monotonic allocation scheme.As a basis for this algorithm serves a decomposition theorem that shows that every minimum cost spanning tree game can be written as nonnegative combination of minimum cost spanning tree games corresponding to 0-1 cost functions.It turns out that the Subtraction Algorithm is closely related to the famous algorithm of Kruskal for the determination of minimum cost spanning trees.For variants of the classical minimum cost spanning tree games we show that population monotonic allocation schemes do not necessarily exist.

KW - operational research

KW - cost allocation

KW - game theory

M3 - Discussion paper

VL - 2001-18

T3 - CentER Discussion Paper

BT - Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes

PB - Microeconomics

CY - Tilburg

ER -

Norde HW, Moretti S, Tijs SH. Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes. Tilburg: Microeconomics. 2001. (CentER Discussion Paper).