Sign in
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:
CoRR (2023)
Keyphrases
</>
lower bound
worst case
online learning
learning process
game theory
learning algorithm
reinforcement learning
multiagent learning
mobile learning
game theoretic
active learning
np hard
learning tasks
learning problems
nash equilibrium
long run
digital games