On some balanced, totally balanced and submodular delivery games

Mathematical Programming, Series B

Volumn 86, Issue 2, 1999, Pages 355-366

  Granot, Daniel ^a   Hamers, Herbert ^b   Tijs, Stef ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b TILBURG UNIVERSITY   (Netherlands)

Author keywords

Chinese postman problem; Cooperative games

Indexed keywords

EID: 0012748277     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050093     Document Type: Article

References (22)

1. Curiel, I., Pederzoli, G., Tijs S. (1989): Sequencing games. Eur. J. Oper. Res. 54, 323-334
2. Edmonds, J., Johnson, E. (1973): Matching, Euler tours and the Chinese postman. Math. Program. 5, 88-124
3. Galil, Z. (1980): Applications of efficient mergable heaps for optimization problems on trees. Acta Inf. 30, 53-58
4. Granot, D., Granot, F., Zhu, W.R. (1996): Naturally submodular digraphs and forbidden digraph configurations. Working paper. Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, B.C., Canada (To appear in: Disc. Appl. Math.)
5. Granot, D., Maschler, M., Owen, G., Zhu, W.R. (1996): The kernel \ nucleolus of a standard tree game. Int. J. Game Theory 25, 219-244
6. Hamers, H. (1997): On the concavity of delivery games. Eur. J. Oper. Res. 99, 445-458
7. Hamers, H., Borm, P., van de Leensel, R., Tijs, S. (1994): The Chinese postman and delivery games. Center Discussion Paper 9476, Tilburg University, The Netherlands (To appear in: Eur. J. Oper. Res.)
8. Hamers, H., Borm, P., Tijs, S. (1995): On games corresponding to sequencing situations with ready times. Math. Program. 69, 471-483
9. Herer, Y., Penn, M. (1995): Characterization of naturally submodular graphs: A polynomial solvable class of the TSP. Proc. Am. Math. Soc. 123(3), 613-619
10. Kuipers, J. (1996): A polynomial time algorithm for computing the nucleolus of convex games. Report M 96-12. Maastricht, The Netherlands
11. Littlechild, S., Owen G. (1973): A simple expression for the Shapley value in a special case. Manage. Sci. 20, 370-372
12. Maschler, M., Peleg, B., Shapley, L. (1972): The kernel and bargaining set of convex games. Int. J. Game Theory 2, 73-93
13. Megiddo, N. (1978): Computational complexity of the game theory approach to cost allocation for a tree. Math. Oper. Res. 3, 189-196
14. Mei-Ko Kwan (1962): Graphic programming using odd or even points. Chin. Math. 1, 273-277
15. van den Nouweland, A., Borm, P. (1991): On the convexity of communication games. Int. J. Game Theory 19, 421-430
16. Orloff, C. (1974): A fundamental problem in vehicle routing. Networks 4, 35-62
17. Owen, G. (1975): On the core of linear production games. Math. Program. 9, 358-370
18. Potters, J., Maschler, M., Reijnierse, H. (1996): Monotonicity properties of the nucleolus of standard tree games. Department of Mathematics Report No. 9556. Nijmegen University, The Netherlands
19. Shapley, L. (1971): Cores of convex games. Int. J. Game Theory 1, 11-26
20. Tardos, E. (1986): A strongly polynomial algorithm to solve combinatorial linear programs. Oper. Res. 34, 250-256
21. Tarjan, R. (1972): Depth-first search and linear graph algorithms. SIAM J. Comput. 2, 146-160
22. Tijs, S. (1981): Bounds for the core and the τ-value. In: Moeschlin, O., Pallaschke, P., eds., Game Theory and Mathematical Economics, pp. 123-132. North Holland Publishing Company