Selfish routing
Fast convergence of selfish rerouting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Adaptive routing with stale information
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Sink Equilibria and Convergence
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Fast convergence to Wardrop equilibria by adaptive sampling methods
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
Convergence and approximation in potential games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Stateless distributed gradient descent for positive linear programs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Stateless near optimal flow control with poly-logarithmic convergence
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Peer-assisted texture streaming in metaverses
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Distributed selfish load balancing on networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Distributed selfish load balancing with weights and speeds
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Proceedings of the fourth international conference on Future energy systems
| Hi-index | 0.00 |
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from the global optimum solution when users play concurrently. We introduce the notion of bounded best response where users react with best response subject to rules that are forced locally by the system. We investigate the problem of load balancing tasks on machines in a bipartite graph model and show that the dynamics of concurrent bounded best response converges to a near-optimum solution quickly, i.e., with poly-logarithmic number of rounds. This is in contrast to the concurrent best response dynamics which cycles far away from the optimum and to any sequential dynamics which requires at least a linear number of rounds to get to a reasonable solution.