Approximately fair cost allocation in metric traveling salesman games

Theory of Computing Systems

Volumn 43, Issue 1, 2008, Pages 19-37

  Blaser M ^a   Shankar Ram, L ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b ETH ZURICH   (Switzerland)

Author keywords

Approximate fair cost allocation; Combinatorial optimization; Cooperative games; Fair cost allocations; Traveling salesman game

Indexed keywords

CHARACTERISTIC FUNCTIONS; COMPLETE GRAPHS; COOPERATIVE GAME; COST ALLOCATION; HAMILTONIAN TOUR; POLYNOMIAL-TIME ALGORITHMS; TRAVELING SALESMAN; TRIANGLE INEQUALITY;

COMBINATORIAL OPTIMIZATION; COSTS; GAME THEORY; POLYNOMIAL APPROXIMATION; VECTORS;

COST ACCOUNTING;

EID: 40849142215     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-9072-z     Document Type: Conference Paper

References (21)

1. Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness and satisfiability of bounded occurrence instances of SAT. Technical Report TR03-022, ECCC (2003)
2. Bird, C.G.: On cost allocation for a spanning tree: a game theoretic approach. Networks 6, 335-350 (1976)
3. Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24, 751-766 (1999)
4. Edmonds, J., Johnson, L.: Matching: a well-solved class of integer linear programs. In: Proceedings of Calgary International Conference on Combinatorial Structures and their Applications, pp. 89-92. Gordon and Breach, New York (1970)
5. Faigle, U., Kern, W.: On the core of ordered submodular cost games. Math. Program. 87, 483-499 (2000)
6. Faigle, U., Fekete, S.P., Hochstättler, W., Kern, W.: On approximately fair cost allocation in Euclidean TSP games. OR Spektrum 20, 29-37 (1998)
7. Frieze, A., Galbiati, G., Maffioli, F.: On the worst-case performance of some algorithms for the asymmetric travelling salesman problem. Networks 12, 23-39 (1982)
8. Goemans, M.X., Skutella, M.: Cooperative facility location games. In: Proc. 11th SODA, pp. 76-85 (2000)
9. Granot, D., Huberman, G.: Minimum cost spanning tree games. Math. Program. 21, 1-18 (1981)
10. Granot, D., Hamers, H., Tijs, S.: On some balanced, totally balanced and submodular delivery games. Math. Program. 86, 355-366 (1999)
11. Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM 52(4), 602-626 (2005)
12. Kolen, A.: Solving covering problems and the uncapacitated plant location algorithms. Eur. J. Oper. Res. 12, 266-278 (1983)
13. Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2, 83-97 (1955)
14. Megiddo, N.: Computational complexity and the game theory approach to cost allocation for a tree. Math. Oper. Res. 3, 189-196 (1978)
15. Okamoto, Y.: Traveling salesman games with the Monge property. Discrete Appl. Math. 138, 349-369 (2004)
16. Papadimitriou, C., Yannakakis, M.: The traveling salesman problem with distances one and two. Math. Oper. Res. 18, 1-11 (1993)
17. Potters, J.A.M., Curiel, I.J., Tijs, S.H.: Traveling salesman games. Math. Program. 53, 199-211 (1992)
18. Shapley, L., Shubik, M.: The assignment game I: the core. Int. J. Game Theory 1, 111-130 (1972)
19. Tamir, A.: On the core of a traveling salesman cost allocation game. Oper. Res. Lett. 8, 31-34 (1988)
20. Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Appl. Math. 8, 85-89 (1984)
21. Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)