{"total":49,"rows":[{"id":"2108.06924","title":"Near-Optimal No-Regret Learning in General Games","created":"2021-08-16","cited_by_count":85,"area":null},{"id":"2201.12736","title":"No-Regret Learning in Time-Varying Zero-Sum Games","created":"2022-01-30","cited_by_count":36,"area":null},{"id":"2206.08742","title":"Near-Optimal No-Regret Learning Dynamics for General Convex Games","created":"2022-06-17","cited_by_count":25,"area":null},{"id":"2206.09495","title":"The Power of Regularization in Solving Extensive-Form Games","created":"2022-06-19","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":"2206.06015","title":"No-Regret Learning in Games with Noisy Feedback: Faster Rates and Adaptivity via Learning Rate Separation","created":"2022-06-13","cited_by_count":17,"area":null},{"id":"2111.08911","title":"Fast Rates for Nonparametric Online Learning: From Realizability to Learning in Games","created":"2021-11-17","cited_by_count":16,"area":null},{"id":"2402.13903","title":"Dealing with unbounded gradients in stochastic saddle-point optimization","created":"2024-02-21","cited_by_count":16,"area":null},{"id":"2211.01851","title":"Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization","created":"2022-11-03","cited_by_count":15,"area":null},{"id":"2301.13120","title":"Doubly Optimal No-Regret Learning in Monotone Games","created":"2023-01-30","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":"2107.01906","title":"The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalities","created":"2021-07-05","cited_by_count":12,"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":"2211.01832","title":"Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods","created":"2022-11-03","cited_by_count":8,"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":"2304.14197","title":"Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games","created":"2023-04-27","cited_by_count":6,"area":null},{"id":"2310.14085","title":"Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback","created":"2023-10-21","cited_by_count":6,"area":null},{"id":"2405.07224","title":"A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights","created":"2024-05-12","cited_by_count":4,"area":null},{"id":"2412.07120","title":"Corrupted Learning Dynamics in Games","created":"2024-12-10","cited_by_count":4,"area":null},{"id":"2412.20203","title":"No-regret learning in harmonic games: Extrapolation in the face of conflicting interests","created":"2024-12-28","cited_by_count":4,"area":null},{"id":"2207.07971","title":"A Survey of Decision Making in Adversarial Games","created":"2022-07-16","cited_by_count":3,"area":null},{"id":"2208.09747","title":"Near-Optimal $\\Phi$-Regret Learning in Extensive-Form Games","created":"2022-08-20","cited_by_count":3,"area":null},{"id":"2407.04591","title":"Proximal Point Method for Online Saddle Point Problem","created":"2024-07-05","cited_by_count":3,"area":null},{"id":"2304.12768","title":"Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games","created":"2023-04-25","cited_by_count":2,"area":null},{"id":"2306.13673","title":"Taming the Exponential Action Set: Sublinear Regret and Fast Convergence to Nash Equilibrium in Online Congestion Games","created":"2023-06-19","cited_by_count":2,"area":null},{"id":"2306.16617","title":"Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation","created":"2023-06-29","cited_by_count":2,"area":null},{"id":"2308.09187","title":"Distributed Extra-gradient with Optimal Complexity and Communication Guarantees","created":"2023-08-17","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.21294","title":"Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach","created":"2024-07-31","cited_by_count":2,"area":null},{"id":"2412.20365","title":"Accelerated regularized learning in finite N-person games","created":"2024-12-29","cited_by_count":2,"area":null},{"id":"2510.11691","title":"Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games","created":"2025-10-13","cited_by_count":2,"area":null},{"id":"2609.04113","title":"Constant regret in general games via higher-order optimism","created":"2026-09-03","cited_by_count":2,"area":null},{"id":"2205.13124","title":"PixelGame: Infrared small target segmentation as a Nash equilibrium","created":"2022-05-26","cited_by_count":1,"area":null},{"id":"2402.09456","title":"Optimistic Thompson Sampling for No-Regret Learning in Unknown Games","created":"2024-02-07","cited_by_count":1,"area":null},{"id":"2404.06516","title":"Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games","created":"2024-04-04","cited_by_count":1,"area":null},{"id":"2405.11746","title":"Configurable Mirror Descent: Towards a Unification of Decision Making","created":"2024-05-20","cited_by_count":1,"area":null},{"id":"2503.16737","title":"Revenue Maximization Under Sequential Price Competition Via The Estimation Of s-Concave Demand Functions","created":"2025-03-20","cited_by_count":1,"area":null},{"id":"2505.14371","title":"Layer-wise Quantization for Quantized Optimistic Dual Averaging","created":"2025-05-20","cited_by_count":1,"area":null},{"id":"2609.22757","title":"Algorithmic Collusion and the Complexity of Information-Value-Free Equilibria","created":"2026-09-19","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":"2507.03150","title":"Last-Iterate Convergence of No-Regret Learning for Equilibria in Bargaining Games","created":"2025-07-03","cited_by_count":0,"area":null},{"id":"2509.23157","title":"Grouped Satisficing Paths in Pure Strategy Games: a Topological Perspective","created":"2025-09-27","cited_by_count":0,"area":null},{"id":"2512.08132","title":"Multi-agent learning under uncertainty: Recurrence vs. concentration","created":"2025-12-09","cited_by_count":0,"area":null},{"id":"2512.08138","title":"Robust equilibria in continuous games: From strategic to dynamic robustness","created":"2025-12-09","cited_by_count":0,"area":null},{"id":"2602.10565","title":"Online Min-Max Optimization: From Individual Regrets to Cumulative Saddle Points","created":"2026-02-11","cited_by_count":0,"area":null},{"id":"2608.09389","title":"Regret, equilibrium, and learning in games: A guided tour","created":"2026-08-10","cited_by_count":0,"area":null}],"next_cursor":null}