Abstract
In this work we address a game theoretic variant of the shortest path problem, in which two decision makers (agents/players) move together along the edges of a graph from a given starting vertex to a given destination. The two players take turns in deciding in each vertex which edge to traverse next. The decider in each vertex also has to pay the cost of the chosen edge. We want to determine the path where each player minimizes its costs taking into account that also the other player acts in a selfish and rational way. Such a solution is a subgame perfect equilibrium and can be determined by backward induction in the game tree of the associated finite game in extensive form.
We show that finding such a path is PSPACE-complete even for bipartite graphs both for the directed and the undirected version of the game. On the other hand, we can give polynomial time algorithms for directed acyclic graphs and for cactus graphs in the undirected case. The latter is based on a decomposition of the graph into components and their resolution by a number of fairly involved dynamic programming arrays.
Ulrich Pferschy and Joachim Schauer were supported by the Austrian Science Fund (FWF): [P 23829-N13]. Andreas Darmann was supported by the Austrian Science Fund (FWF): [P 23724-G11]. We would like to thank Christian Klamler (University of Graz) for fruitful discussions and valuable comments.
Chapter PDF
Similar content being viewed by others
References
Bodlaender, H.: Complexity of path-forming games. Theoretical Computer Science 110(1), 215–245 (1993)
Darmann, A., Klamler, C., Pferschy, U.: Sharing the cost of a path. Technical report (2013), http://ssrn.com/abstract=2287875 (submitted)
Darmann, A., Nicosia, G., Pferschy, U., Schauer, J.: The subset sum game. European Journal on Operational Research 233, 539–549 (2014)
Fraenkel, A.S., Goldschmidt, E.: PSPACE-hardness of some combinatorial games. Journal of Combinatorial Theory 46(1), 21–38 (1987)
Fraenkel, A.S., Scheinerman, E.R., Ullman, D.: Undirected edge geography. Theoretical Computer Science 112(2), 371–381 (1993)
Fraenkel, A.S., Simonson, S.: Geography. Theoretical Computer Science 110(1), 197–214 (1993)
Lichtenstein, D., Sipser, M.: Go is polynomial-space hard. Journal of the ACM 27(2), 393–401 (1980)
Osborne, M.J.: An Introduction to Game Theory. Oxford Univ. Press (2004)
Schaefer, T.J.: On the complexity of some two-person perfect-information games. Journal of Computer and System Sciences 16(2), 185–225 (1978)
Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Proc. of the 5th Symp. on Theory of Computing, STOC 1973, pp. 1–9 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 IFIP International Federation for Information Processing
About this paper
Cite this paper
Darmann, A., Pferschy, U., Schauer, J. (2014). The Shortest Path Game: Complexity and Algorithms. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds) Theoretical Computer Science. TCS 2014. Lecture Notes in Computer Science, vol 8705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44602-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-44602-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44601-0
Online ISBN: 978-3-662-44602-7
eBook Packages: Computer ScienceComputer Science (R0)