Cost allocation for a tree network with heterogeneous customers

Mathematics of Operations Research

Volumn 27, Issue 4, 2002, Pages 647-661

  Granot, Daniel ^a   Kuipers, Jeroen ^b   Chopra, Sunil ^c  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Convex game; Cooperative game; Facets; Nucleolus; Polytope; Shapley value; Strongly polynomial algorithm

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CUSTOMER SATISFACTION; GRAPH THEORY; SET THEORY; TREES (MATHEMATICS);

COMBINATORIAL ALGORITHM; COST ALLOCATION; TREE NETWORK;

COSTS;

EID: 0036873922     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.27.4.647.307     Document Type: Article

References (34)

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