Minimum cost spanning tree games and population monotonic allocation schemes

European Journal of Operational Research

Volumn 154, Issue 1, 2004, Pages 84-97

  Norde, Henk ^a   Moretti, Stefano ^b   Tijs, Stef ^a  

^a TILBURG UNIVERSITY   (Netherlands)

^b CNR   (Italy)

Author keywords

Minimum cost spanning tree games; Population monotonic allocation schemes

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; GAME THEORY; GRAPH THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

MONOTONIC ALLOCATION SCHEMES; SPANNING TREE GAMES;

OPERATIONS RESEARCH;

EID: 0344443166     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00714-2     Document Type: Article

References (9)

1. Bird C.G. On cost allocation for a spanning tree: A game theoretic approach. Networks. 6:1976;335-350.
2. Gillies, D.B., 1953. Some theorems on n-person games, Ph.D. Dissertation, Princeton University Press, Princeton, New Yersey.
3. Granot D., Huberman G. On minimum cost spanning tree games. Mathematical Programming. 21:1981;1-18.
4. Kent, K.J., Skorin-Kapov, D., 1996. Population monotonic cost allocations on MSTs, Discussion Paper, State University of New York at Stony Brook.
5. Kruskal, J.B., 1956. On the shortest spanning subtree of a graph and the traveling salesman problem. In: Proceedings of the American Mathematical Society 7, pp. 48-50.
6. Megiddo N. Cost allocation for Steiner trees. Networks. 8:1978;1-6.
7. Moretti, S., Norde, H., Pham Do, K.H., Tijs, S., 2001. Connection problems in mountains and monotonic allocation schemes, CentER Discussion Paper 2001-12, Tilburg University.
8. Prim R.C. Shortest connection networks and some generalizations. Bell Systems Technical Journal. 36:1957;1389-1401.
9. Sprumont Y. Population monotonic allocation schemes for cooperative games with transferable utility. Games and Economic Behavior. 2:1990;378-394.