The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On the Impact of Combinatorial Structure on Congestion Games
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Algorithms for pure Nash equilibria in weighted congestion games
Journal of Experimental Algorithmics (JEA)
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Engineering fast route planning algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Landmark-based routing in dynamic graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Hierarchy decomposition for faster user equilibria on road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
| Hi-index | 0.00 |
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.