LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Atomic Resource Sharing in Noncooperative Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computing Nash equilibria for scheduling on restricted parallel links
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Nashification and the coordination ratio for a selfish routing game
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Symmetry in network congestion games: pure equilibria and anarchy cost
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Characterizing the Existence of Potential Functions in Weighted Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Performances of One-Round Walks in Linear Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On the existence of pure nash equilibria inweighted congestion games
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Congestion games with variable demands
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
A routing strategy for non-cooperation wireless multi-hop ad hoc networks
Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
Demand allocation games: integrating discrete and continuous strategy spaces
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Proceedings of the 13th ACM Conference on Electronic Commerce
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Mathematics of Operations Research
Optimal Cost Sharing for Resource Selection Games
Mathematics of Operations Research
A routing strategy for non-cooperation wireless multi-hop ad hoc networks
Mobile Information Systems
Hi-index | 0.00 |
In large-scale or evolving networks, such as the Internet, there is no authority possible to enforce a centralized traffic management. In such situations, game theory, and especially the concepts of Nash equilibria and congestion games [Rosenthal 1973] are a suitable framework for analyzing the equilibrium effects of selfish routes selection to network delays. We focus here on single-commodity networks where selfish users select paths to route their loads (represented by arbitrary integer weights). We assume that individual link delays are equal to the total load of the link. We then focus on the algorithm suggested in Fotakis et al. [2005], i.e., a potential-based method for finding pure Nash equilibria in such networks. A superficial analysis of this algorithm gives an upper bound on its time, which is polynomial in n (the number of users) and the sum of their weights W. This bound can be exponential in n when some weights are exponential. We provide strong experimental evidence that this algorithm actually converges to a pure Nash equilibrium in polynomial time. More specifically, our experimental findings suggest that the running time is a polynomial function of n and log W. In addition, we propose an initial allocation of users to paths that dramatically accelerates this algorithm, compared to an arbitrary initial allocation. A by-product of our research is the discovery of a weighted potential function when link delays are exponential to their loads. This asserts the existence of pure Nash equilibria for these delay functions and extends the result of Fotakis et al. [2005].