The P-value for cost sharing in minimum cost spanning tree situations

Theory and Decision

Volumn 56, Issue 1-2, 2004, Pages 47-61

  Branzei, Rodica ^c   Moretti, Stefano ^a,b   Norde, Henk ^d   Tijs, Step ^a,d  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF GENOA   (Italy)

^c ALEXANDRU IOAN CUZA UNIVERSITY OF IASI   (Romania)

^d TILBURG UNIVERSITY   (Netherlands)

Author keywords

Cost sharing; Minimum cost spanning tree games; Population monotonic allocation schemes; Value

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; DECISION THEORY; OPERATIONS RESEARCH; SET THEORY;

COST SHARING; MINIMUM COST SPANNING TREE GAMES; POPULATION MONOTONIC ALLOCATION SCHEMES; VALUE;

TREES (MATHEMATICS);

EID: 9144236953     PISSN: 00405833     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11238-004-5635-5     Document Type: Article

References (18)

1. Aarts, H. (1994), Minimum Cost Spanning Tree Games and Set Games, Ph.D. Dissertation, University of Twente, The Netherlands.
2. Bird, C.G. (1976), On cost allocation for a spanning tree: A game theoretic approach, Networks 6, 335-350.
3. Dutta, B. and Kar, A. (2002), Cost monotonicity, consistency and minimum cost spanning tree games, Warwick Economic Research Paper 629, University of Warwick, UK.
4. Feltkamp, V. (1995), Cooperation in Controlled Network Structures, Ph.D. Dissertation, Tilburg University, The Netherlands.
5. Feltkamp, V., Tijs, S. and Muto, S. (1994), On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems, CentER Discussion Paper 106. Tilburg University, The Netherlands.
6. Gambarelli, G. and Owen, G. (1994), Indirect control of corporations, International Journal of Game Theory 23, 287-302.
7. Granot, D. and Huberman, G. (1981), On minimum cost spanning tree games. Mathematical Programming 21, 1-18.
8. Kar, A. (2002), Axiomatization of the Shapley value on minimum cost spanning tree games, Games and Economic Behavior 38, 265-277.
9. Kent, K.J. and Skorin-Kapov, D. (1996), Population Monotonic Cost Allocations on MSTs, Discussion Paper, State University of New York at Stony Brook, USA.
10. 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, 48-50.
11. Kuipers, J. (1993), On the core of information graph games, International Journal of Game Theory 21, 339-350.
12. Moretti, S., Norde, H., Pham Do, K.H. and Tijs, S. (2002), Connection problems in mountains and monotonic allocation schemes, Top 10, 83-99.
13. Norde, H., Moretti, S. and Tijs, S. (2004), Minimum cost spanning tree games and population monotonic allocation schemes, European Journal of Operational Research 154, 84-97.
14. Owen, G. (1975), On the core of linear production games, Mathematical Programming 9, 358-370.
15. Owen, G. (1995), Game Theory, 3rd edn., San Diego: Academic Press.
16. Owen, G. (1999), Discrete Mathematics and Game Theory, Boston: Kluwer Academic Publishers.
17. Sprumont, Y. (1990), Population monotonic allocation schemes for cooperative games with transferable utility, Games and Economic Behavior 2, 378-394.
18. Tijs, S., Moretti, S., Norde, H. and Branzei, R. (2003), Obligation rules for minimum cost spanning tree situations and their monotonicity properties, Working paper.