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

280 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

Keywords

  • cost allocation
  • operational research

Fingerprint Dive into the research topics of 'Connection Problems in Mountains and Monotonic Allocation Schemes'. Together they form a unique fingerprint.

Cite this