Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
From MaRDI portal
Publication:5501492
DOI10.1145/1011767.1011787zbMath1321.68082OpenAlexW2136388527MaRDI QIDQ5501492
Publication date: 3 August 2015
Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1011767.1011787
Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items (10)
Concurrent imitation dynamics in congestion games ⋮ Approximating Wardrop equilibria with finitely many agents ⋮ Load balancing via random local search in closed and open systems ⋮ Bounds for the Convergence Time of Local Search in Scheduling Problems ⋮ Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks ⋮ Convergence to approximate Nash equilibria in congestion games ⋮ Distributed Learning of Wardrop Equilibria ⋮ Distributed algorithms for QoS load balancing ⋮ Atomic Congestion Games: Fast, Myopic and Concurrent ⋮ An order-based algorithm for minimum dominating set with application in graph mining
This page was built for publication: Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
