{"total":20,"rows":[{"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":"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":"2206.04160","title":"Alternating Mirror Descent for Constrained Min-Max Games","created":"2022-06-08","cited_by_count":13,"area":null},{"id":"2407.04889","title":"Maximizing utility in multi-agent environments by anticipating the behavior of other learners","created":"2024-07-05","cited_by_count":8,"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":"2406.11458","title":"Adversaries With Incentives: A Strategic Alternative to Adversarial Robustness","created":"2024-06-17","cited_by_count":3,"area":null},{"id":"2511.01852","title":"Proximal Regret and Proximal Correlated Equilibria: A New Tractable Solution Concept for Online Learning and Games","created":"2025-11-03","cited_by_count":3,"area":null},{"id":"2608.31166","title":"Constant Individual Regret in General Games","created":"2026-08-31","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":"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":"2503.04202","title":"Computational Intractability of Strategizing against Online Learners","created":"2025-03-06","cited_by_count":2,"area":null},{"id":"2506.16736","title":"Optimism Without Regularization: Constant Regret in Zero-Sum Games","created":"2025-06-20","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":"2304.04665","title":"On algorithmically boosting fixed-point computations","created":"2023-04-04","cited_by_count":0,"area":null},{"id":"2410.05127","title":"Last Iterate Convergence in Monotone Mean Field Games","created":"2024-10-07","cited_by_count":0,"area":null},{"id":"2411.01720","title":"Barriers to Welfare Maximization with No-Regret Learning","created":"2024-11-04","cited_by_count":0,"area":null},{"id":"2504.03592","title":"Optimistic Online Learning in Symmetric Cone Games","created":"2025-04-04","cited_by_count":0,"area":null},{"id":"2510.16782","title":"Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games","created":"2025-10-19","cited_by_count":0,"area":null},{"id":"2602.17486","title":"Linear Convergence in Games with Delayed Feedback via Extra Prediction","created":"2026-02-19","cited_by_count":0,"area":null},{"id":"2609.22839","title":"A Horizon-Independent Regret Bound for Optimistic Hedge in General-Sum Games","created":"2026-09-19","cited_by_count":0,"area":null}],"next_cursor":null}