Load balancing without regret in the bulletin board model
From MaRDI portal
Publication:661046
DOI10.1007/s00446-011-0129-5zbMath1231.68084OpenAlexW1979357207MaRDI QIDQ661046
Éva Tardos, Georgios Piliouras, 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
Computational learning theory (68Q32) Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Related Items
Concurrent imitation dynamics in congestion games ⋮ Generalized mirror descents in congestion games ⋮ Parallel load balancing on constrained client-server topologies ⋮ Generalized mirror descents with non-convex potential functions in atomic congestion games: continuous time and discrete time ⋮ Opinion dynamics with limited information ⋮ Stochastic coordination in heterogeneous load balancing systems ⋮ Opinion dynamics with limited information ⋮ An alternating algorithm for finding linear Arrow-Debreu market equilibria
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Atomic congestion games: fast, myopic and concurrent
- Calibrated learning and correlated equilibrium
- Regret in the on-line decision problem
- Adaptive game playing using multiplicative weights
- The complexity of computing a Nash equilibrium
- Fast convergence to Wardrop equilibria by adaptive sampling methods
- No Regret Learning in Oligopolies: Cournot vs. Bertrand
- Load balancing without regret in the bulletin board model
- Intrinsic robustness of the price of anarchy
- Multiplicative updates outperform generic no-regret learning in congestion games
- The price of selfish routing
- Routing without regret
- How useful is old information (extended abstract)?
- Algorithms – ESA 2004
- Prediction, Learning, and Games
