Abstract
Recently, many speed-up techniques were developed for the computation of shortest paths in networks with rather static edge latencies. Very little is known about dealing with problems which rely on the computation of shortest paths in highly dynamic networks. However, with an increasing amount of traffic, static models of networks rather sparsely reflect realistic scenarios. In the framework of network congestion games, the edge latencies depend on the number of users traveling on the edges. We develop speed-up techniques for the selfish step algorithm to efficiently compute (pure) Nash equilibria in network congestion games. Our approaches
-
1
periodically compute estimations for lengths of shortest paths during the advance of the selfish step algorithm with the purpose to use A * for many path computations, and
-
1
completely save many path computations or substitute them by more efficient tests.
In comparison to an implementation of the selfish-step algorithm using Dijkstra’s algorithm we improve the total running time by a factor of 4 up to 9 on highway networks and grids.
This research has (partially) been supported by the DFG Sonderforschungsbereich 614 “Selbstoptimierende Systeme des Maschinenbaus.”
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 613–622 (2006)
Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In transit to constant time shortest path queries in road networks. In: Proceedings of the 6th Workshop on Algorithms and Experiments (ALENEX), pp. 46–59 (2007)
Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast routing in road networks with transit nodes. Science 316(5824), 566 (2007)
Delling, D., Wagner, D.: Landmark-Based Routing in Dynamic Graphs. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 52–65. Springer, Heidelberg (2007)
Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash Equilibria. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pp. 604–612 (2004)
Gutman, R.: Reach Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In: Proceedings of the 6th International Workshop on Algorithm Engineering and Experiments, pp. 100–111. SIAM, Philadelphia (2004)
Hart, P.E., Nilsson, N.J., Raphael, B.: A Formal Basis for the Heuristic Determination Of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics 4(2), 100–107 (1968)
Panagopoulou, P.N., Spirakis, P.G.: Algorithms for pure Nash equilibria in weighted congestion games. Journal of Experimental Algorithmics (11) (2006)
Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2, 65–67 (1973)
Spiess, H.: Conical volume-delay functions. Transportation Science 24(2), 153–158 (1990)
Sanders, P., Schultes, D.: Engineering fast route planning algorithms. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 23–36. Springer, Heidelberg (2007)
Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 568–579. Springer, Heidelberg (2005)
Sanders, P., Schultes, D.: Engineering highway hierarchies. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 804–816. Springer, Heidelberg (2006)
Schultes, D., Sanders, P.: Dynamic highway-node routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 66–79. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirschner, M., Schengbier, P., Tscheuschner, T. (2009). Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games. In: Vahrenhold, J. (eds) Experimental Algorithms. SEA 2009. Lecture Notes in Computer Science, vol 5526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02011-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-02011-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02010-0
Online ISBN: 978-3-642-02011-7
eBook Packages: Computer ScienceComputer Science (R0)