On the concavity of delivery games

European Journal of Operational Research

Volumn 99, Issue 2, 1997, Pages 445-458

  Hamers, Herbert ^a  

^a TILBURG UNIVERSITY   (Netherlands)

Author keywords

Chinese postman problem; Cooperative games

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION;

CHINESE POSTMAN PROBLEM (CPP); CONCAVE DELIVERY GAMES; EULER GRAPHS;

GAME THEORY;

EID: 0031168880     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00015-X     Document Type: Article

References (17)

1. Aumann, R., and Maschler, M. (1985), "Game theoretic analysis of a bankruptcy problem from the Talmud", Journal of Economic Theory 2, 195-213.
2. Curiel, I., Pederzoli, G., and Tijs, S. (1989), "Sequencing games", European Journal of Operational Research 54, 323-334.
3. Edmonds, J. (1970), "Supmodular functions, matroids, and certain polyhedra", in: R. Guy, H. Hanani, N. Sauer and J. Schönheim (eds.), Combinatorial Structures and their Applications, Gordon and Breach, London, 69-87.
4. Granot, D., and Huberman, G. (1981), "Minimum cost spanning tree games", Mathematical Programming 21, 1-18.
5. Hamers, H., Borm, P., and Tijs, S. (1995), "On games corresponding to sequencing situations with ready times", Mathematical Programming 69, 471-483.
6. Hamers, H., Borm, P., van de Leensel, R., and Tijs, S. (1994), "The Chinese postman and delivery games", Center Discussion Paper 9476, Tilburg University, 1-20.
7. Ichiishi, T. (1981), "Super-modularity: Applications to convex games and the greedy algorithm for LP", Journal of Economic Theory 25, 283-286.
8. Kalai, E., and Zemel, E. (1982a), "Totally balanced games and games of flow", Mathematics of Operations Research 7, 476-478.
9. Kalai, E., and Zemel, E. (1982b), "Generalized network problems yielding totally balanced games", Methods of Operations Research 30, 998-1008.
10. Kwan, M.-K. (1962), "Graphic programming using odd or even points", Chinese Mathematics 1, 273-277.
11. Littlechild, S., and Owen, G. (1973), "A simple expression for the Shapley Value in a special case", Management Science 20, 370-372.
12. Owen, G. (1975), "On the core of linear production games", Mathematical Programming 9, 358-370.
13. Papadimitriou, C. (1994), Computational Complexity, Addison-Wesley, Reading, MA.
14. Potters, J., Curiel, I., and Tijs, S. (1992), "Traveling salesman games", Mathematical Programming 53, 199-211.
15. Shapley, L. (1953), "A value for n-person games", in: A. Tucker and H. Kuhn (eds.), Contributions to the Theory of Games. 307-317.
16. Shapley, L. (1971), "Cores of convex games", International Journal of Game Theory 1, 11-26.
17. Tijs, S. (1981), "Bounds for the core and the τ-value", in: O. Moeschlin and P. Pallaschke (eds.), Game Theory and Mathematical Economics. North-Holland, Amsterdam, 123-132.