{"total":12,"rows":[{"id":"2111.05458","title":"Which priors matter? Benchmarking models for learning latent dynamics","created":"2021-11-09","cited_by_count":26,"area":null},{"id":"2106.12928","title":"Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded Rationality","created":"2021-06-24","cited_by_count":21,"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":"2103.03405","title":"Learning in Matrix Games can be Arbitrarily Complex","created":"2021-03-05","cited_by_count":11,"area":null},{"id":"2111.05986","title":"SyMetric: Measuring the Quality of Learnt Hamiltonian Dynamics Inferred from Vision","created":"2021-11-10","cited_by_count":5,"area":null},{"id":"2203.14129","title":"Nash, Conley, and Computation: Impossibility and Incompleteness in Game Dynamics","created":"2022-03-26","cited_by_count":4,"area":null},{"id":"2207.07105","title":"Continuous-time Analysis for Variational Inequalities: An Overview and Desiderata","created":"2022-07-14","cited_by_count":1,"area":null},{"id":"2503.10186","title":"Convergence and Connectivity: Dynamics of Multi-Agent Q-Learning in Random Networks","created":"2025-03-13","cited_by_count":1,"area":null},{"id":"2505.12609","title":"Hamiltonian of polymatrix zero-sum games","created":"2025-05-19","cited_by_count":1,"area":null},{"id":"2509.22426","title":"Learning from Delayed Feedback in Games via Extra Prediction","created":"2025-09-26","cited_by_count":1,"area":null},{"id":"2109.03974","title":"Constants of Motion: The Antidote to Chaos in Optimization and Game Dynamics","created":"2021-09-08","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}],"next_cursor":null}