Sharing the Cost of a Capacity Network

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms and Applications (1993) (Prentice Hall, New York) Google Scholar
• Bergantiños G., Vidal-Puga J. J. Several approaches to the same rule in minimum cost spanning tree problems. (2004) . Working paper, University of Vigo, SpainGoogle Scholar
• Bergantiños G., Vidal-Puga J. J. A fair rule in minimum cost spanning tree problems. J. Econom. Theory (2007a) 137(1):326–352Crossref, Google Scholar
• Bergantiños G., Vidal-Puga J. J. The optimistic TU game in minimum cost spanning tree problems. Internat. J. Game Theory (2007b) 36(2):223–239Crossref, Google Scholar
• Bergantiños G., Vidal-Puga J. J. Additivity in minimum cost spanning tree problems. J. Math. Econom. (2009) 45(1–2):38–42Crossref, Google Scholar
• Berge C.Graphs and Hypergraphs (1973) (North-Holland, Amsterdam) Google Scholar
• Bird C. J. On cost allocation for a spanning tree: A game theoretic approach. Networks (1976) 6:335–350Crossref, Google Scholar
• Bogomolnaia A., Moulin H. Sharing a minimal cost spanning tree: Beyond the folk solution. (2008) . Working paper, Rice University, Houston, http://www.ruf.rice.edu/∼econ/faculty/Moulin/MCST0704.pdfGoogle Scholar
• Brânzei R., Moretti S., Norde H., Tijs S. The P-value for cost sharing in minimum cost spanning tree situations. Theory Decision (2004) 56:47–61Crossref, Google Scholar
• Dutta B., Kar A. Cost monotonicity, consistency, and minimum cost spanning tree games. Games Econom. Behav. (2004) 48:223–248Crossref, Google Scholar
• Feltkamp T., Tijs S., Muto S. On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems. (1994) . CentER DP 94106, Tilburg University, The NetherlandsGoogle Scholar
• Garey M. R., Johnson D. S.Computers and Intractibility, a Guide to the Theory of NP-Completeness (1979) (W. H. Freeman and Co., San Francisco) Google Scholar
• Granot D., Huberman G. Minimum cost spanning tree games. Math. Programming (1981) 21:1–18Crossref, Google Scholar
• Granot D., Huberman G. On the core and nucleolus of minimum cost spanning tree games. Math. Programming (1984) 29:323–347Crossref, Google Scholar
• Kar A. Axiomatization of the Shapley value in minimum cost spanning tree games. Games Econom. Behav. (2002) 38:265–277Crossref, Google Scholar
• Kruskal J. B. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. (1956) 7:48–50Crossref, Google Scholar
• Littlechild S., Owen G. A simple expression for the Shapley value in a special case. Management Sci. (1973) 20:370–372Link, Google Scholar
• Littlechild S., Thompson G. Aircraft landing fees: A game-theoretic analysis. Bell J. Econom. (1977) 8:186–204Crossref, Google Scholar
• Lyons R., Peres Y.Probability on Trees and Networks (2009) (Cambridge University Press, Cambridge, UK) . Forthcoming. (Current version is available at http://mypage.iu.edu/\string∼rdlyons/)Google Scholar
• Megiddo N. Cost allocation for Steiner trees. Networks (1978) 8:1–6Crossref, Google Scholar
• Norde H., Moretti S., Tijs S. Minimum cost spanning tree games and population monotonic allocation schemes. Eur. J. Oper. Res. (2001) 154:84–97Crossref, Google Scholar
• Ozsoy H. A characterization of Bird's rule. (2007) . Working paper, Rice University, HoustonGoogle Scholar
• Prim R. C. Shortest connection network and some generalization. Bell Systems Tech. J. (1957) 36:1389–1401Crossref, Google Scholar
• Shapley L. S. Cores of convex games. Internat. J. Game Theory (1971) 1:11–26Crossref, Google Scholar
• Sharkey W. W., Ball M. O., Magnanti T. L., Nonma C. L., Nemhauser G. L. Network models in economics. Handbooks in Operation Research and Management Science (1995) (Elsevier, New York) 713–765Google Scholar
• Stong R. Personal communication. (2008) May 10). Available upon request from the authorsGoogle Scholar
• Tamir A. On the core of network synthesis games. Math. Programming (1991) 50:123–135Crossref, Google Scholar
• Tijs S., Brânzei R., Moretti S., Norde H. Obligation rules for mcst situations and their monotonicity properties. Eur. J. Oper. Res. (2006) 175:121–134Crossref, Google Scholar
• Tijs S., Moretti S., Brânzei R., Norde H., Seeger A. The Bird core for minimum cost spanning tree problems revisited: Monotonicity and additivity aspects. Lecture Notes in Economics and Mathematical Systems, Recent Advances in Optimization (2006) 563(Springer, Berlin/Heidelberg) 305–322Crossref, Google Scholar