{"list":"other","total":122,"rows":[{"id":"1609.04747","title":"An overview of gradient descent optimization algorithms","created":"2016-09-15","cited_by_count":1033},{"id":"1710.07035","title":"Generative Adversarial Networks: An Overview","created":"2017-10-19","cited_by_count":590},{"id":"1711.00832","title":"A Unified Game-Theoretic Approach to Multiagent Reinforcement Learning","created":"2017-11-02","cited_by_count":268},{"id":"1701.01724","title":"DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker","created":"2017-01-06","cited_by_count":233},{"id":"1912.09729","title":"Mastering Complex Control in MOBA Games with Deep Reinforcement Learning","created":"2019-12-20","cited_by_count":161},{"id":"1603.01121","title":"Deep Reinforcement Learning from Self-Play in Imperfect-Information Games","created":"2016-03-03","cited_by_count":158},{"id":"1709.02738","title":"Cycles in adversarial regularized learning","created":"2017-09-08","cited_by_count":124},{"id":"2007.13544","title":"Combining Deep Reinforcement Learning and Search for Imperfect-Information Games","created":"2020-07-27","cited_by_count":114},{"id":"1811.00164","title":"Deep Counterfactual Regret Minimization","created":"2018-11-01","cited_by_count":103},{"id":"1807.04252","title":"Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization","created":"2018-07-11","cited_by_count":98},{"id":"1901.08106","title":"Open-ended Learning in Symmetric Zero-sum Games","created":"2019-01-23","cited_by_count":96},{"id":"2108.06924","title":"Near-Optimal No-Regret Learning in General Games","created":"2021-08-16","cited_by_count":85},{"id":"1407.5042","title":"Solving Large Imperfect Information Games Using CFR+","created":"2014-07-18","cited_by_count":78},{"id":"2011.12692","title":"Towards Playing Full MOBA Games with Deep Reinforcement Learning","created":"2020-11-25","cited_by_count":78},{"id":"2004.07804","title":"A Game Theoretic Framework for Model Based Reinforcement Learning","created":"2020-04-16","cited_by_count":73},{"id":"2102.04540","title":"Last-iterate Convergence of Decentralized Optimistic Gradient Descent/Ascent in Infinite-horizon Competitive Markov Games","created":"2021-02-08","cited_by_count":69},{"id":"1809.04040","title":"Solving Imperfect-Information Games via Discounted Regret Minimization","created":"2018-09-11","cited_by_count":68},{"id":"2002.08456","title":"From Poincar\\'e Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization","created":"2020-02-19","cited_by_count":61},{"id":"2002.00057","title":"Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems","created":"2020-01-31","cited_by_count":60},{"id":"1909.12823","title":"A Generalized Training Approach for Multiagent Learning","created":"2019-09-27","cited_by_count":54},{"id":"1903.01373","title":"$\\alpha$-Rank: Multi-Agent Evaluation by Evolution","created":"2019-03-04","cited_by_count":51},{"id":"2104.12761","title":"Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium","created":"2021-04-26","cited_by_count":51},{"id":"2006.09065","title":"The limits of min-max optimization algorithms: convergence to spurious non-critical sets","created":"2020-06-16","cited_by_count":50},{"id":"2010.09514","title":"No-regret learning and mixed Nash equilibria: They do not mix","created":"2020-10-19","cited_by_count":50},{"id":"1410.6445","title":"Reach-Avoid Problems with Time-Varying Dynamics, Targets and Constraints","created":"2014-10-23","cited_by_count":44},{"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},{"id":"2110.05682","title":"Provably Efficient Reinforcement Learning in Decentralized General-Sum Markov Games","created":"2021-10-12","cited_by_count":42},{"id":"1705.02955","title":"Safe and Nested Subgame Solving for Imperfect-Information Games","created":"2017-05-08","cited_by_count":41},{"id":"2102.11494","title":"Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Games","created":"2021-02-23","cited_by_count":40},{"id":"2104.08708","title":"Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization","created":"2021-04-18","cited_by_count":36},{"id":"2201.12736","title":"No-Regret Learning in Time-Varying Zero-Sum Games","created":"2022-01-30","cited_by_count":36},{"id":"2102.09468","title":"Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimization","created":"2021-02-18","cited_by_count":31},{"id":"2203.12056","title":"On Last-Iterate Convergence Beyond Zero-Sum Games","created":"2022-03-22","cited_by_count":31},{"id":"1906.01217","title":"Convergence of Learning Dynamics in Stackelberg Games","created":"2019-06-04","cited_by_count":28},{"id":"2106.14326","title":"Last-iterate Convergence in Extensive-Form Games","created":"2021-06-27","cited_by_count":28},{"id":"2202.09514","title":"Robust Reinforcement Learning as a Stackelberg Game via Adaptively-Regularized Adversarial Training","created":"2022-02-19","cited_by_count":28},{"id":"1805.08195","title":"Depth-Limited Solving for Imperfect-Information Games","created":"2018-05-21","cited_by_count":27},{"id":"2202.01752","title":"Near-Optimal Learning of Extensive-Form Games with Imperfect Information","created":"2022-02-03","cited_by_count":26},{"id":"1906.02027","title":"Last-iterate convergence rates for min-max optimization","created":"2019-06-05","cited_by_count":25},{"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},{"id":"1901.07621","title":"Single Deep Counterfactual Regret Minimization","created":"2019-01-22","cited_by_count":20},{"id":"1711.06930","title":"Computational Results for Extensive-Form Adversarial Team Games","created":"2017-11-18","cited_by_count":19},{"id":"2004.00603","title":"No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium","created":"2020-04-01","cited_by_count":19},{"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},{"id":"1610.07797","title":"Frank-Wolfe Algorithms for Saddle Point Problems","created":"2016-10-25","cited_by_count":18},{"id":"2103.07780","title":"Online Double Oracle","created":"2021-03-13","cited_by_count":18},{"id":"1908.09893","title":"Coarse Correlation in Extensive-Form Games","created":"2019-08-26","cited_by_count":17},{"id":"2008.12234","title":"The Advantage Regret-Matching Actor-Critic","created":"2020-08-27","cited_by_count":17},{"id":"2203.06803","title":"Learning Markov Games with Adversarial Opponents: Efficient Algorithms and Fundamental Limits","created":"2022-03-14","cited_by_count":17},{"id":"1812.10607","title":"Double Neural Counterfactual Regret Minimization","created":"2018-12-27","cited_by_count":16},{"id":"2112.15199","title":"Accelerated Primal-Dual Gradient Method for Smooth and Convex-Concave Saddle-Point Problems with Bilinear Coupling","created":"2021-12-30","cited_by_count":16},{"id":"1910.13010","title":"Poincar\\'e Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games","created":"2019-10-28","cited_by_count":15},{"id":"1904.03821","title":"Creating Pro-Level AI for a Real-Time Fighting Game Using Deep Reinforcement Learning","created":"2019-04-08","cited_by_count":14},{"id":"2008.06495","title":"Joint Policy Search for Multi-agent Collaboration with Imperfect Information","created":"2020-08-14","cited_by_count":13},{"id":"2103.09344","title":"On Accelerated Methods for Saddle-Point Problems with Composite Structure","created":"2021-03-16","cited_by_count":13},{"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},{"id":"2201.07427","title":"Lifted Primal-Dual Method for Bilinearly Coupled Smooth Minimax Optimization","created":"2022-01-19","cited_by_count":13},{"id":"1812.07887","title":"Hierarchical Macro Strategy Model for MOBA Game AI","created":"2018-12-19","cited_by_count":12},{"id":"2103.04550","title":"No Weighted-Regret Learning in Adversarial Bandits with Delays","created":"2021-03-08","cited_by_count":12},{"id":"2006.06566","title":"Optimally Deceiving a Learning Leader in Stackelberg Games","created":"2020-06-11","cited_by_count":11},{"id":"2111.03377","title":"Online Learning in Periodic Zero-Sum Games","created":"2021-11-05","cited_by_count":10},{"id":"1910.06228","title":"Learning to Correlate in Multi-Player General-Sum Sequential Games","created":"2019-10-14","cited_by_count":9},{"id":"2003.00799","title":"Learning to Resolve Alliance Dilemmas in Many-Player Zero-Sum Games","created":"2020-02-27","cited_by_count":9},{"id":"2003.05013","title":"An Introduction to Pursuit-evasion Differential Games","created":"2020-03-10","cited_by_count":9},{"id":"2110.05192","title":"Convex-Concave Min-Max Stackelberg Games","created":"2021-10-05","cited_by_count":9},{"id":"2202.05446","title":"Faster No-Regret Learning Dynamics for Extensive-Form Correlated and Coarse Correlated Equilibria","created":"2022-02-11","cited_by_count":9},{"id":"2101.05248","title":"Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent","created":"2021-01-13","cited_by_count":8},{"id":"2111.05884","title":"Search in Imperfect Information Games","created":"2021-11-10","cited_by_count":8},{"id":"2109.05284","title":"Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions","created":"2021-09-11","cited_by_count":7},{"id":"2205.07223","title":"Sample-Efficient Learning of Correlated Equilibria in Extensive-Form Games","created":"2022-05-15","cited_by_count":7},{"id":"1401.0186","title":"An Existence Result for Hierarchical Stackelberg v/s Stackelberg Games","created":"2013-12-31","cited_by_count":6},{"id":"2010.11737","title":"Efficient Projection-Free Algorithms for Saddle Point Problems","created":"2020-10-21","cited_by_count":6},{"id":"2103.08270","title":"DIPPA: An improved Method for Bilinear Saddle Point Problems","created":"2021-03-15","cited_by_count":6},{"id":"1911.03806","title":"Multiple Pursuer Multiple Evader Differential Games","created":"2019-11-09","cited_by_count":5},{"id":"2012.08382","title":"Evolutionary Game Theory Squared: Evolving Agents in Endogenously Evolving Zero-Sum Games","created":"2020-12-15","cited_by_count":5},{"id":"2111.01876","title":"Game Theory in defence applications: a review","created":"2021-11-02","cited_by_count":5},{"id":"2203.14126","title":"Robust No-Regret Learning in Min-Max Stackelberg Games","created":"2022-03-26","cited_by_count":5},{"id":"2204.04826","title":"Equilibrium Finding in Normal-Form Games Via Greedy Regret Minimization","created":"2022-04-11","cited_by_count":5},{"id":"2204.11525","title":"A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games","created":"2022-04-25","cited_by_count":5},{"id":"1408.1980","title":"Differential Game Logic","created":"2014-08-08","cited_by_count":4},{"id":"1504.06314","title":"Finding Any Nontrivial Coarse Correlated Equilibrium Is Hard","created":"2015-04-23","cited_by_count":4},{"id":"1909.11881","title":"Matching-Based Capture Strategies for 3D Heterogeneous Multiplayer Reach-Avoid Differential Games","created":"2019-09-26","cited_by_count":4},{"id":"2002.04734","title":"Fast Complete Algorithm for Multiplayer Nash Equilibrium","created":"2020-02-11","cited_by_count":4},{"id":"2004.00525","title":"Online distributed algorithms for seeking generalized Nash equilibria in dynamic environments","created":"2020-04-01","cited_by_count":4},{"id":"2007.10857","title":"Smoothed Complexity of 2-player Nash Equilibria","created":"2020-07-21","cited_by_count":4},{"id":"2102.05469","title":"A Pursuit-Evasion Differential Game with Strategic Information Acquisition","created":"2021-02-10","cited_by_count":4},{"id":"2105.06200","title":"Decentralized Online Learning for Noncooperative Games in Dynamic Environments","created":"2021-05-13","cited_by_count":4},{"id":"2107.14625","title":"Single-Leader-Multiple-Followers Stackelberg Security Game with Hypergame Framework","created":"2021-07-30","cited_by_count":4},{"id":"2110.04835","title":"Reinforcement Learning In Two Player Zero Sum Simultaneous Action Games","created":"2021-10-10","cited_by_count":4},{"id":"2201.10377","title":"Public Information Representation for Adversarial Team Games","created":"2022-01-25","cited_by_count":4},{"id":"2204.09467","title":"Decentralized Nash Equilibria Learning for Online Game with Bandit Feedback","created":"2022-04-20","cited_by_count":4},{"id":"1602.01896","title":"Catcher-Evader Games","created":"2016-02-05","cited_by_count":3},{"id":"1609.09341","title":"Machine Learning Techniques for Stackelberg Security Games: a Survey","created":"2016-09-29","cited_by_count":3},{"id":"2002.09047","title":"Distributed No-Regret Learning in Multi-Agent Systems","created":"2020-02-20","cited_by_count":3},{"id":"2005.06923","title":"On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information","created":"2020-05-14","cited_by_count":3},{"id":"2005.11701","title":"Two-Person Zero-Sum Stochastic Linear-Quadratic Differential Games","created":"2020-05-24","cited_by_count":3},{"id":"2008.02679","title":"Solving imperfect-information games via exponential counterfactual regret minimization","created":"2020-08-06","cited_by_count":3},{"id":"2109.14893","title":"Zero-Sum Stackelberg Stochastic Linear-Quadratic Differential Games","created":"2021-09-30","cited_by_count":3},{"id":"2110.02482","title":"$O\\left(1/T\\right)$ Time-Average Convergence in a Generalization of Multiagent Zero-Sum Games","created":"2021-10-06","cited_by_count":3},{"id":"1312.7050","title":"Nash Equilibrium Computation in Subnetwork Zero-Sum Games with Switching Communications","created":"2013-12-26","cited_by_count":2}],"next_cursor":"100"}