Routing without regret

DOI10.1145/1146381.1146392zbMath1314.91050OpenAlexW2015061583MaRDI QIDQ5177263

Katrina Ligett, Eyal Even-Dar, Avrim L. Blum

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1146381.1146392

zbMATH Keywords

game theorynetwork games

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) (n)-person games, (n>2) (91A06) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Online algorithms; streaming algorithms (68W27)

Related Items (17)

Adaptive routing with stale information ⋮ Generalized mirror descents in congestion games ⋮ Approximating Wardrop equilibria with finitely many agents ⋮ Dynamic benchmark targeting ⋮ Generalized mirror descents with non-convex potential functions in atomic congestion games: continuous time and discrete time ⋮ Revisiting log-linear learning: asynchrony, completeness and payoff-based implementation ⋮ Convergence to approximate Nash equilibria in congestion games ⋮ Load balancing without regret in the bulletin board model ⋮ Atomic congestion games: fast, myopic and concurrent ⋮ Securing infrastructure facilities: when does proactive defense help? ⋮ Atomic Congestion Games: Fast, Myopic and Concurrent ⋮ The Price of Stochastic Anarchy ⋮ Management of Variable Data Streams in Networks ⋮ Wealth Inequality and the Price of Anarchy ⋮ Perspectives on multiagent learning ⋮ The Canadian Traveller Problem and its competitive analysis ⋮ Online Learning of Nash Equilibria in Congestion Games

This page was built for publication: Routing without regret