Robuta

https://deepai.org/publication/near-optimal-no-regret-learning-for-general-convex-games Near-Optimal No-Regret Learning for General Convex Games | DeepAI Jun 17, 2022 - 06/17/22 - A recent line of work has established uncoupled learning dynamics such that, when employed by all players in a game, each player's... no regretlearning forconvex gamesnearoptimal https://openreview.net/forum?id=gaftyBQ4Lu Convex-Concave Min-Max Stackelberg Games | OpenReview We introduce polynomial time methods for convex-concave min-max Stackelberg games (with dependent strategy sets) and show their application to the computation... min maxconvexconcavestackelberggames