{"total":18,"rows":[{"id":"2105.08158","title":"The Confluence of Networks, Games and Learning","created":"2021-05-17","cited_by_count":26,"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":"2102.07974","title":"Follow-the-Regularized-Leader Routes to Chaos in Routing Games","created":"2021-02-16","cited_by_count":10,"area":null},{"id":"2206.02041","title":"First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces","created":"2022-06-04","cited_by_count":10,"area":null},{"id":"2311.02374","title":"Riemannian stochastic optimization methods avoid strict saddle points","created":"2023-11-04","cited_by_count":8,"area":null},{"id":"2107.01595","title":"Learning in nonatomic games, Part I: Finite action spaces and population games","created":"2021-07-04","cited_by_count":7,"area":null},{"id":"2109.05829","title":"Zeroth-order non-convex learning via hierarchical dual averaging","created":"2021-09-13","cited_by_count":6,"area":null},{"id":"2107.08011","title":"Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements","created":"2021-07-16","cited_by_count":4,"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":"2411.16366","title":"Connections between sequential Bayesian inference and evolutionary dynamics","created":"2024-11-25","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":"2203.12048","title":"Review of Metrics to Measure the Stability, Robustness and Resilience of Reinforcement Learning","created":"2022-03-22","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":"2506.13286","title":"The impact of uncertainty on regularized learning in games","created":"2025-06-16","cited_by_count":2,"area":null},{"id":"2407.17815","title":"Nested replicator dynamics, nested logit choice, and similarity-based learning","created":"2024-07-25","cited_by_count":0,"area":null},{"id":"2411.12725","title":"The Bounds of Algorithmic Collusion; $Q$-learning, Gradient Learning, and the Folk Theorem","created":"2024-11-19","cited_by_count":0,"area":null},{"id":"2505.10272","title":"Spike-timing-dependent Hebbian learning as noisy gradient descent","created":"2025-05-15","cited_by_count":0,"area":null},{"id":"2610.05071","title":"Discrete Action Matching: Learning Stochastic Dynamics from Samples via State Graphs","created":"2026-10-04","cited_by_count":0,"area":null}],"next_cursor":null}