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

531 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

Keywords

  • operational research
  • cost allocation
  • game theory

Fingerprint Dive into the research topics of 'Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes'. Together they form a unique fingerprint.

  • 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). Microeconomics.