{"total":15,"rows":[{"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":"2111.14737","title":"Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update","created":"2021-11-29","cited_by_count":20,"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":"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":"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":"2207.08426","title":"Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Games","created":"2022-07-18","cited_by_count":4,"area":null},{"id":"2102.01775","title":"Safe Search for Stackelberg Equilibria in Extensive-Form Games","created":"2021-02-02","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":"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":"2605.14277","title":"Parallelizing Counterfactual Regret Minimization","created":"2026-05-14","cited_by_count":2,"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}],"next_cursor":null}