Login / Signup
On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games.
Ioannis Anagnostides
Alkis Kalavasis
Tuomas Sandholm
Manolis Zampetakis
Published in:
ITCS (2024)
Keyphrases
</>
lower bound
worst case
online learning
game theory
learning algorithm
upper bound
objective function
learning process
digital games
vc dimension
nash equilibrium
weighted majority
game theoretic
fixed point
active learning
video games
lower and upper bounds
supervised learning
nash equilibria
stochastic games