Theory of Computing Systems

, Volume 43, Issue 1, pp 19–37 | Cite as

Approximately Fair Cost Allocation in Metric Traveling Salesman Games

Article

Abstract

A traveling salesman game is a cooperative game \({\mathcal{G}}=(N,c_{D})\) . Here N, the set of players, is the set of cities (or the vertices of the complete graph) and cD is the characteristic function where D is the underlying cost matrix. For all SN, define cD(S) to be the cost of a minimum cost Hamiltonian tour through the vertices of S∪{0} where \(0\not \in N\) is called as the home city. Define Core \(({\mathcal{G}})=\{x\in \Re^{|N|}:x(N)=c_{D}(N)\ \mbox{and}\ \forall S\subseteq N,x(S)\le c_{D}(S)\}\) as the core of a traveling salesman game  \({\mathcal{G}}\) . Okamoto (Discrete Appl. Math. 138:349–369, [2004]) conjectured that for the traveling salesman game \({\mathcal{G}}=(N,c_{D})\) with D satisfying triangle inequality, the problem of testing whether Core \(({\mathcal{G}})\) is empty or not is \(\mathsf{NP}\) -hard. We prove that this conjecture is true. This result directly implies the \(\mathsf{NP}\) -hardness for the general case when D is asymmetric. We also study approximately fair cost allocations for these games. For this, we introduce the cycle cover games and show that the core of a cycle cover game is non-empty by finding a fair cost allocation vector in polynomial time. For a traveling salesman game, let \(\epsilon\mbox{-Core}({\mathcal{G}})=\{x\in \Re^{|N|}:x(N)\ge c_{D}(N)\) and SN, x(S)≤εcD(S)} be an ε-approximate core, for a given ε>1. By viewing an approximate fair cost allocation vector for this game as a sum of exact fair cost allocation vectors of several related cycle cover games, we provide a polynomial time algorithm demonstrating the non-emptiness of the log 2(|N|−1)-approximate core by exhibiting a vector in this approximate core for the asymmetric traveling salesman game. We improve it further by finding a \((\frac{4}{3}\log_{3}(|N|)+c)\) -approximate core in polynomial time for some constant c. We also show that there exists an ε0>1 such that it is \(\mathsf{NP}\) -hard to decide whether ε0-Core \(({\mathcal{G}})\) is empty or not.

Keywords

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness and satisfiability of bounded occurrence instances of SAT. Technical Report TR03-022, ECCC (2003) Google Scholar
  2. 2.
    Bird, C.G.: On cost allocation for a spanning tree: a game theoretic approach. Networks 6, 335–350 (1976) MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24, 751–766 (1999) MATHMathSciNetCrossRefGoogle Scholar
  4. 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) Google Scholar
  5. 5.
    Faigle, U., Kern, W.: On the core of ordered submodular cost games. Math. Program. 87, 483–499 (2000) MATHCrossRefMathSciNetGoogle Scholar
  6. 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) MATHCrossRefGoogle Scholar
  7. 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) MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Goemans, M.X., Skutella, M.: Cooperative facility location games. In: Proc. 11th SODA, pp. 76–85 (2000) Google Scholar
  9. 9.
    Granot, D., Huberman, G.: Minimum cost spanning tree games. Math. Program. 21, 1–18 (1981) MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Granot, D., Hamers, H., Tijs, S.: On some balanced, totally balanced and submodular delivery games. Math. Program. 86, 355–366 (1999) MATHCrossRefMathSciNetGoogle Scholar
  11. 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) CrossRefMathSciNetGoogle Scholar
  12. 12.
    Kolen, A.: Solving covering problems and the uncapacitated plant location algorithms. Eur. J. Oper. Res. 12, 266–278 (1983) MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2, 83–97 (1955) CrossRefMathSciNetGoogle Scholar
  14. 14.
    Megiddo, N.: Computational complexity and the game theory approach to cost allocation for a tree. Math. Oper. Res. 3, 189–196 (1978) MATHMathSciNetGoogle Scholar
  15. 15.
    Okamoto, Y.: Traveling salesman games with the Monge property. Discrete Appl. Math. 138, 349–369 (2004) MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Papadimitriou, C., Yannakakis, M.: The traveling salesman problem with distances one and two. Math. Oper. Res. 18, 1–11 (1993) MATHMathSciNetGoogle Scholar
  17. 17.
    Potters, J.A.M., Curiel, I.J., Tijs, S.H.: Traveling salesman games. Math. Program. 53, 199–211 (1992) MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Shapley, L., Shubik, M.: The assignment game I: the core. Int. J. Game Theory 1, 111–130 (1972) CrossRefMathSciNetGoogle Scholar
  19. 19.
    Tamir, A.: On the core of a traveling salesman cost allocation game. Oper. Res. Lett. 8, 31–34 (1988) CrossRefMathSciNetGoogle Scholar
  20. 20.
    Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Appl. Math. 8, 85–89 (1984) MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.FR InformatikUniversität des SaarlandesSaarbrückenGermany
  2. 2.Institut für Theoretische InformatikETH ZürichZürichSwitzerland

Personalised recommendations