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-monotonic allocation scheme. These pmas-es for the connection games result in pmas-es for the cost game.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
12.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)