Co-occurring keywords · papers mentioning both
Papers
Mixed Nash Equilibria in the Adversarial Examples Game
ICML 2021
Neural Auto-Curricula in Two-Player Zero-Sum Games
NeurIPS 2021
Online Learning in Periodic Zero-Sum Games
NeurIPS 2021
Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games
COLT 2021
On the Impossibility of Global Convergence in Multi-Loss Optimization
ICLR 2021
Provably Sample Efficient Reinforcement Learning in Competitive Linear Quadratic Systems
L4DC 2021
Reinforcement Learning for Constrained Markov Decision Processes
AISTATS 2021
Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent
NeurIPS 2021
Solving Partially Observable Stochastic Shortest-Path Games
IJCAI 2021
Strategically efficient exploration in competitive multi-agent reinforcement learning
UAI 2021
Temporal Induced Self-Play for Stochastic Bayesian Games
IJCAI 2021
Towards Unifying Behavioral and Response Diversity for Open-ended Learning in Zero-sum Games
NeurIPS 2021
Adversarial Policies: Attacking Deep Reinforcement Learning
ICLR 2020
All-Pay Bidding Games on Graphs
AAAI 2020
A mean-field analysis of two-player zero-sum games
NeurIPS 2020
Chaos, Extremism and Optimism: Volume Analysis of Learning in Games
NeurIPS 2020
Computing Team-Maxmin Equilibria in Zero-Sum Multiplayer Extensive-Form Games
AAAI 2020
Converging to Team-Maxmin Equilibria in Zero-Sum Multiplayer Games
ICML 2020
Curriculum learning for multilevel budgeted combinatorial problems
NeurIPS 2020
Deep Reinforcement Learning for General Game Playing
AAAI 2020
Do GANs always have Nash equilibria?
ICML 2020
Eyes-Closed Safety Kernels: Safety of Autonomous Systems Under Loss of Observability
RSS 2020
Fast computation of Nash Equilibria in Imperfect Information Games
ICML 2020
Finite Regret and Cycles with Fixed Step-Size via Alternating Gradient Descent-Ascent
COLT 2020
Implicit Learning Dynamics in Stackelberg Games: Equilibria Characterization, Convergence Analysis, and Empirical Study
ICML 2020