Load balancing without regret in the bulletin board model
type: Item
instance of: scholarly article
title: Load balancing without regret in the bulletin board model
zbMATH Open document ID: 1231.68084
author: Georgios Piliouras
author: Éva Tardos
author: Robert D. Kleinberg
published in: Distributed Computing
publication date: 2012-02-06T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 91A80
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 6003516
zbMATH Keywords: protocol performance
zbMATH Keywords: load balancing
zbMATH Keywords: distributed systems
zbMATH Keywords: online learning theory
zbMATH Keywords: price of anarchy
MaRDI profile type: Publication
full work available at URL: s00446-011-0129-5
OpenAlex ID: W1979357207
cites work: Q2934686
cites work: Routing without regret
cites work: Q3549721
cites work: Q3524713
cites work: Prediction, Learning, and Games
cites work: Q4828962
cites work: The complexity of computing a Nash equilibrium
cites work: Fast convergence to Wardrop equilibria by adaptive sampling methods
cites work: Algorithms – ESA 2004
cites work: Calibrated learning and correlated equilibrium
cites work: Regret in the on-line decision problem
cites work: Atomic congestion games: fast, myopic and concurrent
cites work: Adaptive game playing using multiplicative weights
cites work: Q4223194
cites work: Multiplicative updates outperform generic no-regret learning in congestion games
cites work: Load balancing without regret in the bulletin board model
cites work: Q3409969
cites work: The price of selfish routing
cites work: How useful is old information (extended abstract)?
cites work: No Regret Learning in Oligopolies: Cournot vs. Bertrand
cites work: Intrinsic robustness of the price of anarchy
DOI: 10.1007/S00446-011-0129-5
description: scientific article; zbMATH DE number 6003516