Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks

Authors:
Petra Berenbrink;Tom Friedetzky;Iman Hajirasouliha;Zengjian Hu
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, BC, Canada;Department of Computer Science, Durham University, Durham, United Kingdom;School of Computing Science, Simon Fraser University, Burnaby, BC, Canada;School of Computing Science, Simon Fraser University, Burnaby, BC, Canada
Venue:
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Year:
2007

Citing 11
Cited 7

Markov Chain Algorithms for Planar Lattice Structures

SIAM Journal on Computing
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
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
Fast convergence to Wardrop equilibria by adaptive sampling methods

Proceedings of the thirty-eighth annual ACM symposium on Theory of 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
Convergence time to Nash equilibria

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A new analytical method for parallel, diffusion-type load balancing

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

A new analytical method for parallel, diffusion-type load balancing

Journal of Parallel and Distributed Computing
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
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
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
Load balancing via random local search in closed and open systems

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of dynamically reallocating (or rerouting) m weighted tasks among a set of n uniform resources (one may think of the tasks as selfish agents). We assume an arbitrary initial placement of tasks, and we study the performance of distributed, natural reallocation algorithms. We are interested in the time it takes the system to converge to an equilibrium (or get close to an equilibrium). Our main contributions are (i) a modification of the protocol in [2] that yields faster convergence to equilibrium, together with a matching lower bound, and (ii) a non-trivial extension to weighted tasks.