{"total":34,"rows":[{"id":"2106.12529","title":"Who Leads and Who Follows in Strategic Classification?","created":"2021-06-23","cited_by_count":53,"area":null},{"id":"2201.03398","title":"Multiplayer Performative Prediction: Learning in Decision-Dependent Games","created":"2022-01-10","cited_by_count":44,"area":null},{"id":"2103.00623","title":"Scaling up Mean Field Games with Online Mirror Descent","created":"2021-02-28","cited_by_count":32,"area":null},{"id":"2204.08281","title":"Decision-Dependent Risk Minimization in Geometrically Decaying Dynamic Environments","created":"2022-04-08","cited_by_count":32,"area":null},{"id":"2303.02738","title":"Uncoupled and Convergent Learning in Two-Player Zero-Sum Markov Games with Bandit Feedback","created":"2023-03-05","cited_by_count":30,"area":null},{"id":"2105.08158","title":"The Confluence of Networks, Games and Learning","created":"2021-05-17","cited_by_count":26,"area":null},{"id":"2206.03922","title":"A unified stochastic approximation framework for learning in games","created":"2022-06-08","cited_by_count":23,"area":null},{"id":"2106.09082","title":"Zeroth-Order Methods for Convex-Concave Minmax Problems: Applications to Decision-Dependent Risk Minimization","created":"2021-06-16","cited_by_count":18,"area":null},{"id":"2112.02856","title":"Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback","created":"2021-12-06","cited_by_count":15,"area":null},{"id":"2211.13668","title":"Zeroth-Order Alternating Gradient Descent Ascent Algorithms for a Class of Nonconvex-Nonconcave Minimax Problems","created":"2022-11-24","cited_by_count":11,"area":null},{"id":"2206.01880","title":"Learning in Congestion Games with Bandit Feedback","created":"2022-06-04","cited_by_count":10,"area":null},{"id":"2108.02072","title":"Stochastic Subgradient Descent Escapes Active Strict Saddles on Weakly Convex Functions","created":"2021-08-04","cited_by_count":9,"area":null},{"id":"2208.09855","title":"Last-Iterate Convergence with Full and Noisy Feedback in Two-Player Zero-Sum Games","created":"2022-08-21","cited_by_count":9,"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":"2201.12224","title":"Learning Stationary Nash Equilibrium Policies in $n$-Player Stochastic Games with Independent Chains","created":"2022-01-28","cited_by_count":7,"area":null},{"id":"2303.10565","title":"Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games","created":"2023-03-19","cited_by_count":7,"area":null},{"id":"2201.02313","title":"Stochastic Saddle Point Problems with Decision-Dependent Distributions","created":"2022-01-07","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":"2203.08957","title":"Risk-Averse No-Regret Learning in Online Convex Games","created":"2022-03-16","cited_by_count":5,"area":null},{"id":"2501.08263","title":"Multiplayer Federated Learning: Reaching Equilibrium with Less Communication","created":"2025-01-14","cited_by_count":5,"area":null},{"id":"2604.16087","title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","created":"2026-04-17","cited_by_count":5,"area":null},{"id":"2209.02838","title":"A Zeroth-Order Momentum Method for Risk-Averse Online Convex Games","created":"2022-09-06","cited_by_count":3,"area":null},{"id":"2312.16609","title":"Exploiting hidden structures in non-convex games for convergence to Nash equilibrium","created":"2023-12-27","cited_by_count":3,"area":null},{"id":"2311.02423","title":"Payoff-based learning with matrix multiplicative weights in quantum games","created":"2023-11-04","cited_by_count":2,"area":null},{"id":"2111.05486","title":"Uncoupled Bandit Learning towards Rationalizability: Benchmarks, Barriers, and Algorithms","created":"2021-11-10","cited_by_count":0,"area":null},{"id":"2205.06968","title":"No-regret learning for repeated non-cooperative games with lossy bandits","created":"2022-05-14","cited_by_count":0,"area":null},{"id":"2210.05222","title":"Stochastic Direct Search Method for Blind Resource Allocation","created":"2022-10-11","cited_by_count":0,"area":null},{"id":"2501.14652","title":"Decoupled SGDA for Games with Intermittent Strategy Communication","created":"2025-01-24","cited_by_count":0,"area":null},{"id":"2509.01953","title":"Entry Barriers in Content Markets","created":"2025-09-02","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":"2604.19065","title":"Last-Iterate Guarantees for Learning in Co-coercive Games","created":"2026-04-21","cited_by_count":0,"area":null},{"id":"2605.21263","title":"Nonparametric Learning and Earning with One-Point Feedback under Nonstationarity","created":"2026-05-20","cited_by_count":0,"area":null},{"id":"2610.05428","title":"Learning in Continuous Games from Pairwise Preference Feedback","created":"2026-10-04","cited_by_count":0,"area":null},{"id":"2610.14333","title":"Decentralized Bandit Learning of Markov Perfect Equilibria","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}