Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
Balls and bins: a study in negative dependence
Random Structures & Algorithms
Journal of the ACM (JACM)
Selfish traffic allocation for server farms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
Dispersion games: general definitions and some specific learning results
Eighteenth national conference on Artificial intelligence
Priority service and max-min fairness
IEEE/ACM Transactions on Networking (TON)
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Distributed selfish load balancing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fast convergence to Wardrop equilibria by adaptive sampling methods
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Welfare maximization in congestion games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Convergence time to Nash equilibrium in load balancing
ACM Transactions on Algorithms (TALG)
Greedy distributed optimization of multi-commodity flows
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Convergence to approximate Nash equilibria in congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fast load balancing via bounded best response
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
REPLEX: dynamic traffic engineering based on wardrop routing policies
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Atomic congestion games among coalitions
ACM Transactions on Algorithms (TALG)
Distributed Learning of Wardrop Equilibria
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Atomic Congestion Games: Fast, Myopic and Concurrent
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Conflicting Congestion Effects in Resource Allocation Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract
Proceedings of the forty-first annual ACM symposium on Theory of computing
Management of Variable Data Streams in Networks
Algorithmics of Large and Complex Networks
Concurrent imitation dynamics in congestion games
Proceedings of the 28th ACM symposium on Principles of distributed computing
Distributed algorithms for QoS load balancing
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A dynamic approach for load balancing
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Nonadaptive selfish routing with online demands
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Myopic distributed protocols for singleton and independent-resource congestion games
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Balls and bins distributed load balancing algorithm for channel allocation
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Computer Networks: The International Journal of Computer and Telecommunications Networking
Peer-assisted texture streaming in metaverses
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
SIAM Journal on Computing
Distributed selfish load balancing on networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Atomic congestion games among coalitions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Distributed selfish load balancing with weights and speeds
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Conflicting Congestion Effects in Resource Allocation Games
Operations Research
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
ACM Transactions on Algorithms (TALG)
Approximating wardrop equilibria with finitely many agents
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Information Sciences: an International Journal
Brief announcement: threshold load balancing in networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We consider n anonymous selfish users that route their communication through m parallel links. The users are allowed to reroute, concurrently, from overloaded links to underloaded links. The different rerouting decisions are concurrent, randomized and independent. The rerouting process terminates when the system reaches a Nash equilibrium, in which no user can improve its state.We study the convergence rate of several migration policies. The first is a very natural policy, which balances the expected load on the links, for the case that all users are identical and apply it, we show that the rerouting terminates in expected O(log log n + log m) stages. Later, we consider the Nash rerouting policies class, in which every rerouting stage is a Nash equilibrium and the users are greedy with respect to the next load they observe. We show a similar termination bounds for this class. We study the structural properties of the Nash rerouting policies, and derive both existence result and an efficient algorithm for the case that the number of links is small. We also show that if the users have different weights then there exists a set of weights such that every Nash rerouting terminates in Ω(√n) stages with high probability.