Co-occurring keywords · papers mentioning both
Papers
Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback
IJCAI 2025
The Oracle Complexity of Simplex-based Matrix Games: Linear Separability and Nash Equilibria
COLT 2025
Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization
JMLR 2024
Near-Optimal Pure Exploration in Matrix Games: A Generalization of Stochastic Bandits & Dueling Bandits
AISTATS 2024
Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games
AISTATS 2023
On the Impossibility of Learning to Cooperate with Adaptive Partner Strategies in Repeated Games
ICML 2022
Conic Blackwell Algorithm: Parameter-Free Convex-Concave Saddle-Point Solving
NeurIPS 2021
Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization
NeurIPS 2021
Learning in Matrix Games can be Arbitrarily Complex
COLT 2021
Matrix games with bandit feedback
UAI 2021
Sublinear Classical and Quantum Algorithms for General Matrix Games
AAAI 2021
Variance Reduction for Matrix Games
NeurIPS 2019
A Game-Theoretic Approach to Apprenticeship Learning
NeurIPS 2007