Traveling salesman games with the Monge property

Discrete Applied Mathematics

Volumn 138, Issue 3, 2004, Pages 349-369

  Okamoto, Yoshio ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Cooperative game; Core; Polynomially solvable case; Traveling salesman

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; GRAPH THEORY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

COOPERATIVE GAMES; CORE; POLYNOMIALLY SOLVABLE CASE; TRAVELING SALESMAN;

GAME THEORY;

EID: 1642601803     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.08.005     Document Type: Article

References (68)

1. Baki Md.F., Kabadi S.N. Pyramidal traveling salesman problem. Comput. Oper. Res. 26:1999;353-369.
2. Bilbao J.M. Cooperative Games on Combinatorial Structures. 2000;Kluwer Academic Publishers, Dordrecht.
3. Bird C.G. On cost allocation for a spanning tree. a game theoretic approach Networks. 6:1976;335-350.
4. Burkard R.E., Deǐneko V.G., van Dal R., van der Veen J.A.A., Woeginger G.J. Well-solvable cases of the travelling salesman problem. a survey SIAM Rev. 40:1998;496-546.
5. Burkard R.E., Klinz B., Rudolf R. Perspectives of Monge properties in optimization. Discrete Appl. Math. 70:1996;95-161.
6. P. Chardaire, On the core of facility location games, submitted.
7. G. Christopher, M. Farach, M. Trick, The structure of circular decomposable metrics, in: Proceedings of the Fourth ESA, Lecture Notes in Computer Science, Vol. 1136, Springer, New York, 1996, pp. 406-418.
8. Curiel I.J. Cooperative Game Theory and Applications: Cooperative Games Arising from Combinatorial Optimization Problems. 1997;Kluwer Academic Publishers, Dordrecht.
9. V.G. Deǐneko, V.L. Filonenko, On the reconstruction of specially structured matrices, Aktualnyje Problemy EVM i programmirovanije, Dnepropetrovsk, DGU, 1979 (in Russian).
10. Deǐneko V.G., Rudolf R., Woeginger G.J. Sometimes travelling is easy. the master tour problem SIAM J. Discrete Math. 11:1998;81-93.
11. Demidenko V.M. A special case of travelling salesman problems. Izv. Akad. Nauk Az. SSR, Ser. Fiz.-Tekh. Mat. Nauk. 5:1976;28-32. (in Russian).
12. Deng X., Ibaraki T., Nagamochi H. Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24:1999;751-766.
13. Deng X., Papadimitriou C.H. On the complexity of cooperative solution concepts. Math. Oper. Res. 19:1994;257-266.
14. Enomoto H., Oda Y., Ota K. Pyramidal tours with step-backs and the asymmetric traveling salesman problem. Discrete Appl. Math. 87:1998;57-65.
15. Faigle U., Fekete S.P., Hochstättler W., Kern W. On the complexity of testing membership in the core of min-cost spanning tree games. Internat. J. Game Theory. 26:1997;361-366.
16. Faigle U., Fekete S.P., Hochstättler W., Kern W. On approximately fair cost allocation in Euclidean TSP games. OR Spektrum. 20:1998;29-37.
17. Faigle U., Kern W. On some approximately balanced combinatorial cooperative games. Z. Oper. Res. 38:1993;141-152.
18. Faigle U., Kern W. On the core of ordered submodular cost games. Math. Programing. 87:2000;483-499.
19. Faigle U., Kern W., Kuipers J. On the computation of the nucleolus of a cooperative game. Internat. J. Game Theory. 30:2001;79-98.
20. Fang Q., Cai M., Deng X. Total balancedness condition for Steiner tree games. Discrete Appl. Math. 127:2003;555-563.
21. Fishburn P.C., Pollak H.O. Fixed route cost allocation. Amer. Math. Monthly. 90:1983;366-378.
22. Fleischer L. Recent progress in submodular function minimization. OPTIMA. 64:2000;1-11.
23. S. Fujishige, Submodular Functions and Optimization, Ann. Discrete Math., Vol. 47, North-Holland, Amsterdam, 1991.
24. Fujishige S. Submodular function minimization and related topics. Optimization Methods and Software. 18:2003;167-180.
25. Gilmore P.C., Lawler E.L., Shmoys D.B. Well-solved special cases. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. The Traveling Salesman Problem - A Guided Tour of Combinatorial Optimization. 1985;87-143 Wiley, Chichester.
26. M.X. Goemans, M. Skutella, Cooperative facility location games, J. Algorithms, to appear (an extended abstract version has appeared in: Proceedings of the 11th SODA, 2000, pp. 76-85).
27. Granot D., Granot F., Zhu W.R. Naturally submodular digraphs and forbidden digraph configurations. Discrete Appl. Math. 100:2000;67-84.
28. Granot D., Hamers H., Tijs S. On some balanced, totally balanced and submodular delivery games. Math. Programing. 86:1999;355-366.
29. Granot D., Huberman G. Minimum cost spanning tree games. Math. Programing. 21:1981;1-18.
30. M. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, Vol. 2, Springer, Berlin, Heidelberg, 1988 (2nd Edition, 1993).
31. Herer Y.T. Submodularity and the traveling salesman problem. Eur. J. Oper. Res. 114:1999;489-508.
32. Herer Y., Penn M. Characterization of naturally submodular graphs. a polynomial solvable class of the TSP Proc. Amer. Math. Soc. 123:1995;613-619.
33. S. Iwata, Fully combinatorial algorithm for submodular function minimization, J. Combin. Theory Ser. B 84 (2002) 203-212. Corrections are on his webpage ( http://www.sr3.t.u-tokyo.ac.jp/~iwata/ ).
34. Iwata S., Fleischer L., Fujishige S. A combinatorial strongly polynomial-time algorithm for minimizing submodular functions. J. Assoc. Comput. Mach. 48:2001;761-777.
35. Kabadi S.N. Polynomially solvable cases of the traveling salesman problem. Gutin G., Punnen A.P. The Traveling Salesman Problem and its Variations. 2002;489-584 Kluwer Academic Press, Dordrecht.
36. Kabadi S.N. New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalizations. Discrete Appl. Math. 119:2002;149-168.
37. Kabadi S.N., Baki Md.F. Gilmore-Gomory type traveling salesman problems. Comput. Oper. Res. 26:1999;329-351.
38. Kalmanson K. Edgeconvex circuits and the traveling salesman problem. Canad. J. Math. 27:1975;1000-1010.
39. Y. Kannai, The core and balancedness, in: R.J. Aumann, S. Hart (Eds.), Handbook of Game Theory, Vol. 1, Elsevier, Amsterdam, 1992, pp. 355-395.
40. Kolen A. Solving covering problems and the uncapacitated plant location algorithms. Eur. J. Oper. Res. 12:1983;266-278.
41. Kolen A., Tamir A. Covering problems. Mirchandani P.B., Francis R.L. Discrete Location Theory. 1990;263-304 Wiley, New York.
42. B. Korte, J. Vygen, Combinatorial Optimization: Theory and Algorithms, Algorithms and Combinatorics, Vol. 21, Springer, Berlin, Heidelberg, 2000 (2nd Edition, 2002).
43. Kruskal J.B. On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. Amer. Math. Soc. 7:1956;48-50.
44. Kuhn H.W. The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2:1955;83-97.
45. Kuipers J. A note on the 5-person traveling salesman game. Z. Oper. Res. 38:1993;131-139.
46. J. Kuipers, A polynomial time algorithm for computing the nucleolus of convex games, Report M 96-12, Maastricht University, 1996.
47. Maschler M., Peleg B., Shapley L. The kernel and bargaining set of convex games. Internat. J. Game Theory. 2:1972;73-93.
48. T. Matsui, Personal communication.
49. Megiddo N. Cost allocation for Steiner trees. Networks. 8:1978;1-6.
50. Murota K. Discrete Convex Analysis. 2003;SIAM, Philadelphia.
51. Nešetřil J., Milkov E., Nešetřilov H. Otakar Borůvka on minimum spanning tree problem. translation of both the 1926 papers, comments, history Discrete Math. 233:2001;3-36.
52. Oda Y. An asymmetric analogue of van der Veen conditions and the traveling salesman problem. Discrete Appl. Math. 109:2001;279-292.
53. Y. Okamoto, Submodularity of some classes of the combinatorial optimization games, Math. Methods Oper. Res., 58 (2003) 131-139.
54. Papadimitriou C.H. The Euclidean travelling salesman problem is NP-complete. Theoret. Comput. Sci. 4:1977;237-244.
55. Park J.K. A special case of the. n -vertex traveling salesman problem that can be solved in O(n) time Inform. Process. Lett. 40:1991;247-254.
56. B. Peleg, Axiomatizations of the core, in: R.J. Aumann, S. Hart (Eds.), Handbook of Game Theory, Vol. 1, Elsevier, Amsterdam, 1992, pp. 397-412.
57. Potters J.A.M. A class of traveling salesman games. Methods Oper. Res. 59:1989;263-276.
58. Potters J.A.M., Curiel I.J., Tijs S.H. Traveling salesman games. Math. Programing. 53:1992;199-211.
59. Prim R.C. Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36:1957;1389-1401.
60. Schrijver A. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combin. Theory, Ser. B. 80:2000;346-355.
61. L. Shapley, Cores of convex games, Internat. J. Game Theory 1 (1971) 11-26. (Errata, in the same volume, 1972, 111-130.).
62. Shapley L., Shubik M. The assignment game I. the core Internat. J. Game Theory. 1:1972;111-130.
63. Solymosi T., Raghavan T.E.S. Assignment games with stable core. Internat. J. Game Theory. 30:2001;177-185.
64. Supnick F. Extreme Hamiltonian lines. Ann. Math. 66:1957;179-201.
65. Tamir A. On the core of a traveling salesman cost allocation game. Oper. Res. Lett. 8:1988;31-34.
66. Tamir A. On the core of cost allocation games defined on location problems. Transportation Sci. 27:1992;81-86.
67. Tijs S. Bounds for the core and the. τ -value Moeschlin O., Pallaschke P. Game Theory and Mathematical Economics. 1981;123-132 North-Holland, Amsterdam.
68. van der Veen J.A.A. A new class of pyramidally solvable symmetric traveling salesman problems. SIAM J. Discrete Math. 7:1994;585-592.