A guided tour of Chernoff bounds
Information Processing Letters
Recovery time of dynamic allocation processes
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Fast concurrent access to parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
Markov Chain Algorithms for Planar Lattice Structures
SIAM Journal on 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
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
Fast convergence of selfish rerouting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
Fast convergence to Wardrop equilibria by adaptive sampling methods
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
REPLEX: dynamic traffic engineering based on wardrop routing policies
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
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
Management of Variable Data Streams in Networks
Algorithmics of Large and Complex Networks
A dynamic approach for load balancing
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
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
Load balancing via random local search in closed and open systems
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
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
Decentralized proactive resource allocation for maximizing throughput of P2P Grid
Journal of Parallel and Distributed Computing
Load balancing via random local search in closed and open systems
Queueing Systems: Theory and Applications
Cooperation in multi-organization scheduling
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A first step towards analyzing the convergence time in player-specific singleton congestion games
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Approximating wardrop equilibria with finitely many agents
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Information Sciences: an International Journal
Hi-index | 0.00 |
Suppose that a set of m tasks are to be shared as equally as possible amongst a set of n resources. A game-theoretic mechanism to find a suitable allocation is to associate each task with a "selfish agent", and require each agent to select a resource, with the cost of a resource being the number of agents to select it. Agents would then be expected to migrate from overloaded to underloaded resources, until the allocation becomes balanced.Recent work has studied the question of how this can take place within a distributed setting in which agents migrate selfishly without any centralized control. In this paper we discuss a natural protocol for the agents which combines the following desirable features: It can be implemented in a strongly distributed setting, uses no central control, and has good convergence properties. For m ≫ n, the system becomes approximately balanced (an ε-Nash equilibrium) in expected time O(log log m). We show using a martingale technique that the process converges to a perfectly balanced allocation in expected time O(log log m + n4). We also give a lower bound of Ω (max{log log m, n}) for the convergence time.