Load balancing without regret in the bulletin board model

DOI10.1007/S00446-011-0129-5MaRDI QIDQ661046zbMATH OpenOpenAlexFDO

Authors Georgios Piliouras, Éva Tardos, Robert D. Kleinberg

Publication date 6 February 2012

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-011-0129-5

zbMATH Keywords

distributed systemsload balancingonline learning theoryprice of anarchyprotocol performance

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational learning theory (68Q32) Applications of game theory (91A80)

Recommendations

• Load balancing without regret in the bulletin board model
• Improved algorithms for online load balancing
• Distributed Selfish Load Balancing
• Distributed selfish load balancing on networks
• Distributed selfish load balancing on networks

Cites work

• Adaptive game playing using multiplicative weights
• Algorithms – ESA 2004
• Atomic congestion games: fast, myopic and concurrent
• Calibrated learning and correlated equilibrium
• Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• How useful is old information (extended abstract)?
• scientific article; zbMATH DE number 5485549 (Why is no real title available?)
• scientific article; zbMATH DE number 1233801 (Why is no real title available?)
• scientific article; zbMATH DE number 2119691 (Why is no real title available?)
• Intrinsic robustness of the price of anarchy
• Learning, regret minimization, and equilibria
• Load balancing without regret in the bulletin board model
• Multiplicative updates outperform generic no-regret learning in congestion games (extended abstract)
• No regret learning in oligopolies: Cournot vs. Bertrand
• Prediction, Learning, and Games
• Regret in the on-line decision problem
• Routing without regret, on convergence to Nash equilibria of regret-minimizing algorithms in routing games
• The complexity of computing a Nash equilibrium
• The price of selfish routing
• Worst-case equilibria

Cited in

(11)

• Generalized mirror descents with non-convex potential functions in atomic congestion games: continuous time and discrete time
• An alternating algorithm for finding linear Arrow-Debreu market equilibria
• Opinion dynamics with limited information
• Parallel load balancing on constrained client-server topologies
• Concurrent imitation dynamics in congestion games
• Generalized mirror descents in congestion games
• scientific article; zbMATH DE number 1149413 (Why is no real title available?)
• Load balancing without regret in the bulletin board model
• Opinion dynamics with limited information
• Distributed dispatching in the parallel server model
• Improved algorithms for online load balancing

This page was built for publication: Load balancing without regret in the bulletin board model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q661046)