Connection Problems in Mountains and Monotonic Allocation Schemes
Sociedad de Estadistica e Investigacidn Operativa Top, Vol. 10, No. 1, pp. 83-99, 2002
17 Pages Posted: 26 Mar 2011
Date Written: 2002
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 the corresponding 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-monotonie allocation scheme. These pmas-es for the connection games result in pmas-es for the cost game.
Keywords: Minimum cost spanning tree problems, monotonic allocation scheme
JEL Classification: 91A12, 91A43
Suggested Citation: Suggested Citation