Equilibria in Online Games
From MaRDI portal
Publication:2796211
DOI10.1137/090760386zbMath1337.91027OpenAlexW2298716356MaRDI QIDQ2796211
Roee Engelberg, Joseph (Seffi) Naor
Publication date: 23 March 2016
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090760386
Noncooperative games (91A10) Games involving graphs (91A43) Other game-theoretic models (91A40) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound for randomized list update algorithms
- Competitive algorithms for distributed data management.
- Two-terminal routing games with unknown active players
- Online algorithms. The state of the art
- Competitive snoopy caching
- Competitive analysis of incentive compatible on-line auctions
- Optimal sliding-window strategies in networks with long round-trip delays
- The Price of Stability for Network Design with Fair Cost Allocation
- The Dynamic Pivot Mechanism
- Dynamic Steiner Tree Problem
- Dueling algorithms
- Algorithmic Game Theory
- Selfish caching in distributed systems
This page was built for publication: Equilibria in Online Games