{"total":85,"rows":[{"id":"2110.04184","title":"When Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently?","created":"2021-10-08","cited_by_count":67,"area":null},{"id":"2407.00617","title":"Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning","created":"2024-06-30","cited_by_count":45,"area":"alignment"},{"id":"2111.06008","title":"Near-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games","created":"2021-11-11","cited_by_count":43,"area":null},{"id":"2210.12529","title":"On-Demand Sampling: Learning Optimally from Multiple Distributions","created":"2022-10-22","cited_by_count":39,"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":"2204.11417","title":"Uncoupled Learning Dynamics with $O(\\log T)$ Swap Regret in Multiplayer Games","created":"2022-04-25","cited_by_count":35,"area":null},{"id":"2310.19647","title":"Fast swap regret minimization and applications to approximate correlated equilibria","created":"2023-10-30","cited_by_count":32,"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":"2207.14211","title":"Regret Minimization and Convergence to Equilibria in General-sum Markov Games","created":"2022-07-28","cited_by_count":24,"area":null},{"id":"2502.16852","title":"Improving LLM General Preference Alignment via Optimistic Online Mirror Descent","created":"2025-02-24","cited_by_count":24,"area":"alignment"},{"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":"2301.13306","title":"Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics","created":"2023-01-30","cited_by_count":20,"area":null},{"id":"2305.19496","title":"Is Learning in Games Good for the Learners?","created":"2023-05-31","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":"2112.07640","title":"How and Why to Manipulate Your Own Agent: On the Incentives of Users of Learning Agents","created":"2021-12-14","cited_by_count":17,"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":"2206.02640","title":"Policy Optimization for Markov Games: Unified Framework and Faster Convergence","created":"2022-06-06","cited_by_count":16,"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":"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":"2206.04160","title":"Alternating Mirror Descent for Constrained Min-Max Games","created":"2022-06-08","cited_by_count":13,"area":null},{"id":"2401.15240","title":"Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games","created":"2024-01-26","cited_by_count":13,"area":null},{"id":"2209.12430","title":"$O(T^{-1})$ Convergence of Optimistic-Follow-the-Regularized-Leader in Two-Player Zero-Sum Markov Games","created":"2022-09-26","cited_by_count":11,"area":null},{"id":"2204.05466","title":"Independent Natural Policy Gradient Methods for Potential Games: Finite-time Global Convergence with Entropy Regularization","created":"2022-04-12","cited_by_count":10,"area":null},{"id":"2303.12287","title":"Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games","created":"2023-03-22","cited_by_count":10,"area":null},{"id":"2307.09470","title":"Multi-Player Zero-Sum Markov Games with Networked Separable Interactions","created":"2023-07-13","cited_by_count":10,"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":"2503.24340","title":"Faster Rates for No-Regret Learning in General Games via Cautious Optimism","created":"2025-03-31","cited_by_count":10,"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":"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":"2312.04792","title":"Playing Large Games with Oracles and AI Debate","created":"2023-12-08","cited_by_count":6,"area":null},{"id":"2403.00188","title":"Impact of Decentralized Learning on Player Utilities in Stackelberg Games","created":"2024-02-29","cited_by_count":5,"area":null},{"id":"2401.05133","title":"Neural Population Learning beyond Symmetric Zero-sum Games","created":"2024-01-10","cited_by_count":4,"area":null},{"id":"2406.02357","title":"The complexity of approximate (coarse) correlated equilibrium for incomplete information games","created":"2024-06-04","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":"2602.06348","title":"Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret","created":"2026-02-06","cited_by_count":4,"area":null},{"id":"2602.21436","title":"Efficient Uncoupled Learning Dynamics with $\\tilde{O}\\!\\left(T^{-1/4}\\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback","created":"2026-02-24","cited_by_count":4,"area":null},{"id":"2608.04149","title":"Sublogarithmic Swap Regret in Multiplayer General-Sum Games via Hybrid Regularization","created":"2026-08-04","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":"2405.08318","title":"No-Regret Learning of Nash Equilibrium for Black-Box Games via Gaussian Processes","created":"2024-05-14","cited_by_count":3,"area":null},{"id":"2405.20880","title":"Games with Payments between Learning Agents","created":"2024-05-31","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":"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.03321","title":"Adaptive Decision-Making with Constraints and Dependent Losses: Performance Guarantees and Applications to Online and Nonlinear Identification","created":"2023-04-06","cited_by_count":2,"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":"2310.05230","title":"Global Convergence of Policy Gradient Methods in Reinforcement Learning, Games and Control","created":"2023-10-08","cited_by_count":2,"area":null},{"id":"2407.10207","title":"Learning to Steer Markovian Agents under Model Uncertainty","created":"2024-07-14","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.02825","title":"On Separation Between Best-Iterate, Random-Iterate, and Last-Iterate Convergence of Learning in Games","created":"2025-03-04","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":"2505.17277","title":"Comparator-Adaptive $\\Phi$-Regret: Improved Bounds, Simpler Algorithms, and Applications to Games","created":"2025-05-22","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":"2201.01163","title":"Analyzing Micro-Founded General Equilibrium Models with Many Agents using Deep Reinforcement Learning","created":"2022-01-03","cited_by_count":1,"area":null},{"id":"2410.09701","title":"Transformers as Game Players: Provable In-context Game-playing Capabilities of Pre-trained Models","created":"2024-10-13","cited_by_count":1,"area":null},{"id":"2509.07901","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","created":"2025-09-09","cited_by_count":1,"area":null},{"id":"2509.19901","title":"Pure Exploration via Frank-Wolfe Self-Play","created":"2025-09-24","cited_by_count":1,"area":null},{"id":"2511.02157","title":"Near Optimal Convergence to Coarse Correlated Equilibrium in General-Sum Markov Games","created":"2025-11-04","cited_by_count":1,"area":null},{"id":"2601.04516","title":"LinguaGame: A Linguistically Grounded Game-Theoretic Paradigm for Multi-Agent Dialogue Generation","created":"2026-01-08","cited_by_count":1,"area":"agents"},{"id":"2111.05486","title":"Uncoupled Bandit Learning towards Rationalizability: Benchmarks, Barriers, and Algorithms","created":"2021-11-10","cited_by_count":0,"area":null},{"id":"2210.11402","title":"Learning Rationalizable Equilibria in Multiplayer Games","created":"2022-10-20","cited_by_count":0,"area":null},{"id":"2301.11802","title":"Decentralized Online Bandit Optimization on Directed Graphs with Regret Bounds","created":"2023-01-27","cited_by_count":0,"area":null},{"id":"2310.17538","title":"Little Exploration is All You Need","created":"2023-10-26","cited_by_count":0,"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":"2405.03158","title":"Decentralized Online Learning in General-Sum Stackelberg Games","created":"2024-05-06","cited_by_count":0,"area":null},{"id":"2406.04201","title":"Securing Equal Share: A Principled Approach for Learning Multiplayer Symmetric Games","created":"2024-06-06","cited_by_count":0,"area":null},{"id":"2410.02400","title":"An Online Feasible Point Method for Benign Generalized Nash Equilibrium Problems","created":"2024-10-03","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":"2411.01721","title":"Computational Lower Bounds for Regret Minimization in Normal-Form Games","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":"2506.03802","title":"Learning in Matching Games with Bandit Feedback","created":"2025-06-04","cited_by_count":0,"area":null},{"id":"2507.11366","title":"Characterizing Nash Equilibria in Zero-Sum Games: A Physics-Inspired, Parallelizable Approach with a Linear Number of Gradient Queries","created":"2025-07-15","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":"2512.24818","title":"Unregularized Linear Convergence in Zero-Sum Game from Preference Feedback","created":"2025-12-31","cited_by_count":0,"area":"alignment"},{"id":"2603.28281","title":"Corruption-robust Offline Multi-agent Reinforcement Learning From Human Feedback","created":"2026-03-30","cited_by_count":0,"area":"alignment"},{"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.16751","title":"Constant Swap Regret in General-Sum Games via Two-Scale Higher-Order Optimism","created":"2026-09-15","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}