{"total":56,"rows":[{"id":"2106.06885","title":"Online Learning with Optimism and Delay","created":"2021-06-13","cited_by_count":33,"area":null},{"id":"2106.14326","title":"Last-iterate Convergence in Extensive-Form Games","created":"2021-06-27","cited_by_count":28,"area":null},{"id":"2206.01315","title":"Sample-Efficient Reinforcement Learning of Partially Observable Markov Games","created":"2022-06-02","cited_by_count":27,"area":null},{"id":"2202.01752","title":"Near-Optimal Learning of Extensive-Form Games with Imperfect Information","created":"2022-02-03","cited_by_count":26,"area":null},{"id":"2206.04122","title":"ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret","created":"2022-06-08","cited_by_count":24,"area":null},{"id":"2106.06279","title":"Model-Free Learning for Two-Player Zero-Sum Partially Observable Markov Games with Perfect Recall","created":"2021-06-11","cited_by_count":21,"area":null},{"id":"2202.00237","title":"Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the Gap Between Learning in Extensive-Form and Normal-Form Games","created":"2022-02-01","cited_by_count":19,"area":null},{"id":"2203.06803","title":"Learning Markov Games with Adversarial Opponents: Efficient Algorithms and Fundamental Limits","created":"2022-03-14","cited_by_count":17,"area":null},{"id":"2102.06973","title":"Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games","created":"2021-02-13","cited_by_count":15,"area":null},{"id":"2205.15294","title":"Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descent","created":"2022-05-30","cited_by_count":15,"area":null},{"id":"2301.11241","title":"On the Convergence of No-Regret Learning Dynamics in Time-Varying Games","created":"2023-01-26","cited_by_count":14,"area":null},{"id":"2305.14709","title":"Regret Matching+: (In)Stability and Fast Convergence in Games","created":"2023-05-24","cited_by_count":14,"area":null},{"id":"2406.10631","title":"Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms","created":"2024-06-15","cited_by_count":14,"area":null},{"id":"2105.12954","title":"Better Regularization for Sequential Decision Spaces: Fast Convergence Rates for Nash, Correlated, and Team Equilibria","created":"2021-05-27","cited_by_count":13,"area":null},{"id":"2212.12567","title":"Adapting to game trees in zero-sum imperfect information games","created":"2022-12-23","cited_by_count":11,"area":null},{"id":"2111.05884","title":"Search in Imperfect Information Games","created":"2021-11-10","cited_by_count":8,"area":null},{"id":"2110.04961","title":"Equivalence Analysis between Counterfactual Regret Minimization and Online Mirror Descent","created":"2021-10-11","cited_by_count":7,"area":null},{"id":"2205.07223","title":"Sample-Efficient Learning of Correlated Equilibria in Extensive-Form Games","created":"2022-05-15","cited_by_count":7,"area":null},{"id":"2404.13891","title":"Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent","created":"2024-04-22","cited_by_count":7,"area":null},{"id":"2311.00676","title":"Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games","created":"2023-11-01","cited_by_count":6,"area":null},{"id":"2506.01242","title":"General search techniques without common knowledge for imperfect-information games, and application to superhuman Fog of War chess","created":"2025-06-02","cited_by_count":6,"area":null},{"id":"2605.19928","title":"Real-Time Parallel Counterfactual Regret Minimization","created":"2026-05-19","cited_by_count":6,"area":null},{"id":"2105.13203","title":"Conic Blackwell Algorithm: Parameter-Free Convex-Concave Saddle-Point Solving","created":"2021-05-27","cited_by_count":5,"area":null},{"id":"2605.30094","title":"PokerSkill: LLMs Can Play Expert-Level Poker without Training or Solvers","created":"2026-05-28","cited_by_count":5,"area":null},{"id":"2202.12277","title":"Solving optimization problems with Blackwell approachability","created":"2022-02-24","cited_by_count":4,"area":null},{"id":"2410.17336","title":"Computing Optimal Regularizers for Online Linear Optimization","created":"2024-10-22","cited_by_count":4,"area":null},{"id":"2602.16928","title":"Discovering Multiagent Learning Algorithms with Large Language Models","created":"2026-02-18","cited_by_count":4,"area":null},{"id":"2607.28520","title":"Agents That Certify Their Own Exploits: Confidence-Scheduled Restricted Responses for Safe Opponent Exploitation","created":"2026-07-30","cited_by_count":4,"area":null},{"id":"2101.09603","title":"Optimistic and Adaptive Lagrangian Hedging","created":"2021-01-23","cited_by_count":3,"area":null},{"id":"2407.20351","title":"LiteEFG: An Efficient Python Library for Solving Extensive-form Games","created":"2024-07-29","cited_by_count":3,"area":null},{"id":"2510.04407","title":"Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games","created":"2025-10-06","cited_by_count":3,"area":null},{"id":"2303.01074","title":"Learning not to Regret","created":"2023-03-02","cited_by_count":2,"area":null},{"id":"2309.00656","title":"Local and adaptive mirror descents in extensive-form games","created":"2023-09-01","cited_by_count":2,"area":null},{"id":"2410.23398","title":"On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games","created":"2024-10-30","cited_by_count":2,"area":null},{"id":"2510.17067","title":"Convergence of Regret Matching in Potential Games and Constrained Optimization","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2605.14277","title":"Parallelizing Counterfactual Regret Minimization","created":"2026-05-14","cited_by_count":2,"area":null},{"id":"2203.05920","title":"Generalized Bandit Regret Minimizer Framework in Imperfect Information Extensive-Form Game","created":"2022-03-11","cited_by_count":1,"area":null},{"id":"2208.09452","title":"Unified Policy Optimization for Continuous-action Reinforcement Learning in Non-stationary Tasks and Games","created":"2022-08-19","cited_by_count":1,"area":null},{"id":"2301.08830","title":"ApproxED: Approximate exploitability descent via learned best responses","created":"2023-01-20","cited_by_count":1,"area":null},{"id":"2501.16600","title":"On the Power of Perturbation under Sampling in Solving Extensive-Form Games","created":"2025-01-28","cited_by_count":1,"area":null},{"id":"2503.12770","title":"Faster Game Solving via Asymmetry of Step Sizes","created":"2025-03-17","cited_by_count":1,"area":null},{"id":"2504.18868","title":"Approximating Nash Equilibria in General-Sum Games via Meta-Learning","created":"2025-04-26","cited_by_count":1,"area":null},{"id":"2511.08174","title":"Deep (Predictive) Discounted Counterfactual Regret Minimization","created":"2025-11-11","cited_by_count":1,"area":null},{"id":"2606.29457","title":"How Much Due Diligence Before You Bid? Learning in Intractable Takeover Auctions","created":"2026-06-28","cited_by_count":1,"area":null},{"id":"2205.12031","title":"Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games: Corrections","created":"2022-05-24","cited_by_count":0,"area":null},{"id":"2303.04956","title":"Time-Dependent Blackwell Approachability and Application to Absorbing Games","created":"2023-03-09","cited_by_count":0,"area":null},{"id":"2308.08693","title":"AI planning in the imagination: High-level planning on learned abstract search spaces","created":"2023-08-16","cited_by_count":0,"area":null},{"id":"2308.11256","title":"Efficient Last-iterate Convergence Algorithms in Solving Games","created":"2023-08-22","cited_by_count":0,"area":null},{"id":"2309.03084","title":"Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play","created":"2023-09-04","cited_by_count":0,"area":null},{"id":"2504.18917","title":"Meta-Learning in Self-Play Regret Minimization","created":"2025-04-26","cited_by_count":0,"area":null},{"id":"2509.13653","title":"Efficient Last-Iterate Convergence in Regret Minimization via Adaptive Reward Transformation","created":"2025-09-17","cited_by_count":0,"area":null},{"id":"2511.12083","title":"No-Regret Strategy Solving in Imperfect-Information Games via Pre-Trained Embedding","created":"2025-11-15","cited_by_count":0,"area":null},{"id":"2602.15252","title":"Decision Making under Imperfect Recall: Algorithms and Benchmarks","created":"2026-02-16","cited_by_count":0,"area":null},{"id":"2607.25835","title":"Distributed Constraint Optimization via Online Learning and Iterative Pricing with Application to Large-Scale Satellite Scheduling","created":"2026-07-28","cited_by_count":0,"area":null},{"id":"2609.11923","title":"GPU-CFR: 80x Faster Counterfactual Regret Minimization by Compiling the Game to Static Dataflow and CUDA Graph Replay","created":"2026-09-10","cited_by_count":0,"area":null},{"id":"2610.19016","title":"IR-PRM+ with Previous-Utility Prediction: Constant Regret and Best-Iterate Convergence","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}