Cost Allocation for a Tree Network with Heterogeneous Customers

References

• Bird C. On cost allocation for a spanning tree: A game theoretic approach. Networks (1976) 6:335–350Crossref, Google Scholar
• Davis M., Maschler M. The kernel of a cooperative game. Naval Res. Logistics Quart. (1965) 12:223–259Crossref, Google Scholar
• Davis M., Maschler M., Shubik M. Existence of stable payoff configurations for cooperative games. Essays in Mathematical Economics in Honor of Oskar Morgenstern (1967) (Princeton University Press, Princeton, NJ) 39–52Crossref, Google Scholar
• Derks J., Kuipers J. On the core of routing games. Internat. J. Game Theory (1997) 26:193–206Crossref, Google Scholar
• Granot D. A generalized linear production model: A unifying model. Math. Programming (1986) 34:212–223Crossref, Google Scholar
• Granot D., Granot F. On some network flow games. Math. Oper. Res. (1992) 17:792–841Link, Google Scholar
• Granot D., Hamers H., Tijs S. On some balanced, totally balanced and submodular delivery games. Math. Programming (1999) 86:355–366Crossref, 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
• Granot D., Maschler M., Owen G., Zhu W. R. The kernel/nucleolus for a standard tree game. Internat. J. Game Theory (1996) 25:219–244Crossref, Google Scholar
• Granot D., Kuipers J., Chopra S. Cost allocation for a tree network with heterogeneous customers. (2000) . Research Memorandum M00-02, Department of Mathematics, Maastricht University, Maastricht, The NetherlandsGoogle Scholar
• Grötschel M., Lovász L., Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica (1981) 1:169–179Crossref, Google Scholar
• Hamers H., Borm P., van de Leensel R., Tijs S. Cost allocation in the Chinese postman problem. Eur. J. Oper. Res. (1999) 118:153–163Crossref, Google Scholar
• Iwata S., Fleischer L., Fujishige S. A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. (2000) . http://arXiv.org, math.co/0004089Google Scholar
• Kalai E., Zemel E. Totally balanced games and games of flow. Math. Oper. Res. (1982a) 7:476–478Link, Google Scholar
• Kalai E., Zemel E. Generalized network flow problems yielding totally balanced games. Oper. Res. (1982b) 30:998–1008Link, Google Scholar
• Kopelowitz A. Computation of the kernels of simple games and the nucleolus of N-person games. (1967) . Research Memorandum No. 31, Department of Mathematics, The Hebrew University, Jerusalem, IsraelGoogle Scholar
• Kuipers J. Combinatorial methods in cooperative game theory. (1994) . Ph.D. thesis, University of Maastricht, Maastricht, The NetherlandsGoogle Scholar
• Kuipers J., Solymosi T., Aarts H. Computing the nucleolus of some combinatorially-structured games. Math. Programming, Ser. A (2000) 88:541–563Crossref, Google Scholar
• Littlechild S. C. A simple expression for the nucleolus in a special case. Internat. J. Game Theory (1974) 3:21–29Crossref, Google Scholar
• Littlechild S. C., Owen G. A simple expression for the Shapley value in a special case. Management Sci. (1973) 20:370–372Link, Google Scholar
• Maschler M., Peleg B., Shapley L. S. The kernel and bargaining set of convex games. Internat. J. Game Theory (1972) 2:73–93Google Scholar
• Maschler M., Peleg B., Shapley L. S. Geometric properties of the kernel, nucleolus and related solution concepts. Math. Oper. Res. (1979) 4:303–338Link, Google Scholar
• Megiddo N. Computational complexity of the game theory approach to cost allocation for a tree. Math. Oper. Res. (1978) 3:189–196Link, Google Scholar
• Nemhauser G., Wolsey L.Integer and Combinatorial Optimization (1988) (John Wiley and Sons, New York) Crossref, Google Scholar
• Owen G. On the core of linear production games. Math. Programming (1975) 9:358–370Crossref, Google Scholar
• Potters J., Curiel I., Tijs S. Traveling salesman games. Math. Programming (1992) 53:199–211Crossref, Google Scholar
• Potters J., Reijnierse J. Γ-component additive games. Internat. J. Game Theory (1995) 24:49–56Crossref, Google Scholar
• Reijnierse J., Maschler M., Potters J., Tijs S. Simple flow games. Games and Econom. Behaviour (1996) 16:238–260Crossref, Google Scholar
• Schmeidler D. The nucleolus of a characteristic function game. SIAM J. Appl. Math. (1969) 17:1163–1170Crossref, Google Scholar
• Shapley L. Cores of convex games. Internat. J. Game Theory (1971) 1:11–26Crossref, Google Scholar
• Sobolev A. I. The characterization of optimality principles in cooperative games by functional equations. Math. Methods Soc. Sci. (1975) 6:150–165RussianGoogle Scholar
• Solymosi T., Aarts H., Driessen T. On computing the nucleolus of a balanced connected game. Math. Oper. Res. (1998) 23:983–1009Link, Google Scholar
• Tamir A. On the core of the traveling salesman cost allocation game. Oper. Res. Lett. (1989) 8:31–34Crossref, Google Scholar