scientific article

DOI10.4086/toc.2010.v006a008zbMath1213.91041OpenAlexW2202514461MaRDI QIDQ3002821

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

Publication date: 24 May 2011

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2010.v006a008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Nash equilibriaregret minimizationrouting games

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Games involving graphs (91A43) Multistage and repeated games (91A20)

Related Items (3)

Concurrent imitation dynamics in congestion games ⋮ Competitive routing over time ⋮ Small-Loss Bounds for Online Learning with Partial Information

This page was built for publication: