{"total":18,"rows":[{"id":"2106.14326","title":"Last-iterate Convergence in Extensive-Form Games","created":"2021-06-27","cited_by_count":28,"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":"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":"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":"2305.14709","title":"Regret Matching+: (In)Stability and Fast Convergence in Games","created":"2023-05-24","cited_by_count":14,"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":"2210.14640","title":"HSVI can solve zero-sum Partially Observable Stochastic Games","created":"2022-10-26","cited_by_count":8,"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":"2105.13203","title":"Conic Blackwell Algorithm: Parameter-Free Convex-Concave Saddle-Point Solving","created":"2021-05-27","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":"2309.00656","title":"Local and adaptive mirror descents in extensive-form games","created":"2023-09-01","cited_by_count":2,"area":null},{"id":"2112.10890","title":"Revisiting Game Representations: The Hidden Costs of Efficiency in Sequential Decision-making Algorithms","created":"2021-12-20","cited_by_count":0,"area":null},{"id":"2310.09658","title":"A Generalized Extensive-Form Fictitious Play Algorithm","created":"2023-10-14","cited_by_count":0,"area":null},{"id":"2408.14778","title":"GPU-Accelerated Counterfactual Regret Minimization","created":"2024-08-27","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":"2608.14761","title":"CFR without Unbiasedness: Deterministic Guarantees for Persistent Public-Chance Schedules","created":"2026-08-14","cited_by_count":0,"area":null},{"id":"2608.25182","title":"Minimax Alternating Regret for the Experts Problem and Online Convex Optimization","created":"2026-08-25","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}],"next_cursor":null}