Connection Problems in Mountains and Monotonic Allocation Schemes

S. Moretti, H.W. Norde, K.H. Pham Do, S.H. Tijs

Research output: Working paperDiscussion paperOther research output

228 Downloads (Pure)

Abstract

Directed minimum cost spanning tree problems of a special kind are studied,namely those which show up in considering the problem of connecting units (houses)in mountains with a purifier.For such problems an easy method is described to obtain a minimum cost spanning tree.The related cost sharing problem is tackled by considering thecorresponding cooperative cost game with the units as players and also the related connection games,for each unit one.The cores of the connection games have a simple structure and each core element can be extended to a population monotonic allocation scheme (pmas)and also to a bi-monotonic allocation scheme.These pmas-es for the connection games result in pmas-es for the cost game.
Original languageEnglish
Place of PublicationTilburg
PublisherMicroeconomics
Number of pages17
Volume2001-12
Publication statusPublished - 2001

Publication series

NameCentER Discussion Paper
Volume2001-12

Fingerprint

Costs

Keywords

  • cost allocation
  • operational research

Cite this

Moretti, S., Norde, H. W., Pham Do, K. H., & Tijs, S. H. (2001). Connection Problems in Mountains and Monotonic Allocation Schemes. (CentER Discussion Paper; Vol. 2001-12). Tilburg: Microeconomics.
Moretti, S. ; Norde, H.W. ; Pham Do, K.H. ; Tijs, S.H. / Connection Problems in Mountains and Monotonic Allocation Schemes. Tilburg : Microeconomics, 2001. (CentER Discussion Paper).
@techreport{63cc8f022ae641bb92117938ccf8b5c6,
title = "Connection Problems in Mountains and Monotonic Allocation Schemes",
abstract = "Directed minimum cost spanning tree problems of a special kind are studied,namely those which show up in considering the problem of connecting units (houses)in mountains with a purifier.For such problems an easy method is described to obtain a minimum cost spanning tree.The related cost sharing problem is tackled by considering thecorresponding cooperative cost game with the units as players and also the related connection games,for each unit one.The cores of the connection games have a simple structure and each core element can be extended to a population monotonic allocation scheme (pmas)and also to a bi-monotonic allocation scheme.These pmas-es for the connection games result in pmas-es for the cost game.",
keywords = "cost allocation, operational research",
author = "S. Moretti and H.W. Norde and {Pham Do}, K.H. and S.H. Tijs",
note = "Pagination: 17",
year = "2001",
language = "English",
volume = "2001-12",
series = "CentER Discussion Paper",
publisher = "Microeconomics",
type = "WorkingPaper",
institution = "Microeconomics",

}

Moretti, S, Norde, HW, Pham Do, KH & Tijs, SH 2001 'Connection Problems in Mountains and Monotonic Allocation Schemes' CentER Discussion Paper, vol. 2001-12, Microeconomics, Tilburg.

Connection Problems in Mountains and Monotonic Allocation Schemes. / Moretti, S.; Norde, H.W.; Pham Do, K.H.; Tijs, S.H.

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

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - Connection Problems in Mountains and Monotonic Allocation Schemes

AU - Moretti, S.

AU - Norde, H.W.

AU - Pham Do, K.H.

AU - Tijs, S.H.

N1 - Pagination: 17

PY - 2001

Y1 - 2001

N2 - Directed minimum cost spanning tree problems of a special kind are studied,namely those which show up in considering the problem of connecting units (houses)in mountains with a purifier.For such problems an easy method is described to obtain a minimum cost spanning tree.The related cost sharing problem is tackled by considering thecorresponding cooperative cost game with the units as players and also the related connection games,for each unit one.The cores of the connection games have a simple structure and each core element can be extended to a population monotonic allocation scheme (pmas)and also to a bi-monotonic allocation scheme.These pmas-es for the connection games result in pmas-es for the cost game.

AB - Directed minimum cost spanning tree problems of a special kind are studied,namely those which show up in considering the problem of connecting units (houses)in mountains with a purifier.For such problems an easy method is described to obtain a minimum cost spanning tree.The related cost sharing problem is tackled by considering thecorresponding cooperative cost game with the units as players and also the related connection games,for each unit one.The cores of the connection games have a simple structure and each core element can be extended to a population monotonic allocation scheme (pmas)and also to a bi-monotonic allocation scheme.These pmas-es for the connection games result in pmas-es for the cost game.

KW - cost allocation

KW - operational research

M3 - Discussion paper

VL - 2001-12

T3 - CentER Discussion Paper

BT - Connection Problems in Mountains and Monotonic Allocation Schemes

PB - Microeconomics

CY - Tilburg

ER -

Moretti S, Norde HW, Pham Do KH, Tijs SH. Connection Problems in Mountains and Monotonic Allocation Schemes. Tilburg: Microeconomics. 2001. (CentER Discussion Paper).