{"total":23,"rows":[{"id":"2306.11700","title":"Last-Iterate Convergent Policy Gradient Primal-Dual Methods for Constrained MDPs","created":"2023-06-20","cited_by_count":28,"area":null},{"id":"2307.09470","title":"Multi-Player Zero-Sum Markov Games with Networked Separable Interactions","created":"2023-07-13","cited_by_count":10,"area":null},{"id":"2502.17625","title":"Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback","created":"2025-02-24","cited_by_count":10,"area":null},{"id":"2305.16610","title":"Adaptively Perturbed Mirror Descent for Learning in Games","created":"2023-05-26","cited_by_count":9,"area":null},{"id":"2506.03464","title":"From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applications","created":"2025-06-04","cited_by_count":8,"area":null},{"id":"2604.15242","title":"Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier","created":"2026-04-16","cited_by_count":5,"area":null},{"id":"2604.16087","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","created":"2026-04-17","cited_by_count":5,"area":null},{"id":"2602.06348","title":"Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret","created":"2026-02-06","cited_by_count":4,"area":null},{"id":"2602.21436","title":"Efficient Uncoupled Learning Dynamics with $\\tilde{O}\\!\\left(T^{-1/4}\\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback","created":"2026-02-24","cited_by_count":4,"area":null},{"id":"2405.19811","title":"Approximate Global Convergence of Independent Learning in Multi-Agent Systems","created":"2024-05-30","cited_by_count":3,"area":null},{"id":"2312.04905","title":"Two-Timescale Q-Learning with Function Approximation in Zero-Sum Stochastic Games","created":"2023-12-08","cited_by_count":2,"area":null},{"id":"2312.08008","title":"Learning in Zero-Sum Markov Games: Relaxing Strong Reachability and Mixing Time Assumptions","created":"2023-12-13","cited_by_count":2,"area":null},{"id":"2312.12067","title":"Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence Beyond the Minty Property","created":"2023-12-19","cited_by_count":2,"area":null},{"id":"2407.20128","title":"Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games","created":"2024-07-29","cited_by_count":2,"area":null},{"id":"2405.17463","title":"Is Thompson Sampling Susceptible to Algorithmic Collusion?","created":"2024-05-23","cited_by_count":1,"area":null},{"id":"2506.14518","title":"Two-Player Zero-Sum Games with Bandit Feedback","created":"2025-06-17","cited_by_count":1,"area":null},{"id":"2609.34656","title":"Minimax Last-Iterate Convergence in Matrix Games with Observed Actions","created":"2026-09-28","cited_by_count":1,"area":null},{"id":"2403.07890","title":"$\\widetilde{O}(T^{-1})$ Convergence to (Coarse) Correlated Equilibria in Full-Information General-Sum Markov Games","created":"2024-02-02","cited_by_count":0,"area":null},{"id":"2405.03158","title":"Decentralized Online Learning in General-Sum Stackelberg Games","created":"2024-05-06","cited_by_count":0,"area":null},{"id":"2505.13562","title":"Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback","created":"2025-05-19","cited_by_count":0,"area":null},{"id":"2602.00606","title":"Actor-Dual-Critic Dynamics for Zero-sum and Identical-Interest Stochastic Games","created":"2026-01-31","cited_by_count":0,"area":null},{"id":"2609.34812","title":"Polylogarithmic Nash Regret in Matrix Games with Bandit Feedback","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2610.05968","title":"Fast Last-Iterate Convergence in Zero-Sum Markov Games with Bandit Feedback","created":"2026-10-05","cited_by_count":0,"area":null}],"next_cursor":null}