New no-regret learning dynamics achieve external and swap regret bounds that adapt to cumulative strategy and utility corruption in games.
Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Corrupted Learning Dynamics in Games
New no-regret learning dynamics achieve external and swap regret bounds that adapt to cumulative strategy and utility corruption in games.