Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Analysis of a graph coloring based distributed load balancing algorithm
Journal of Parallel and Distributed Computing
Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Randomized algorithms
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fast convergence of selfish rerouting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Sink Equilibria and Convergence
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Distributed selfish load balancing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The effect of collusion in congestion games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fast convergence to Wardrop equilibria by adaptive sampling methods
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On the Impact of Combinatorial Structure on Congestion Games
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Convergence to approximate Nash equilibria in congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fast and compact: a simple class of congestion games
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Convergence and approximation in potential games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Atomic congestion games among coalitions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Characterizing the Existence of Potential Functions in Weighted Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
| Hi-index | 0.00 |
We study here the effect of concurrent greedy moves of players in atomic congestion games where nselfish agents (players) wish to select a resource each (out of mresources) so that her selfish delay there is not much. The problem of "maintaining" global progress while allowing concurrent play is exactly what is examined and answered here. We examine two orthogonal settings : (i) A game where the players decide their moves without global information, each acting "freely" by sampling resources randomly and locally deciding to migrate (if the new resource is better) via a random experiment. Here, the resources can have quite arbitrary latency that is load dependent. (ii) An "organised" setting where the players are pre-partitioned into selfish groups (coalitions) and where each coalition does an improving coalitional move. Our work considers concurrent selfish play for arbitrary latencies for the first time. Also, this is the first time where fast coalitional convergence to an approximate equilibrium is shown.