{"total":16,"rows":[{"id":"2302.08300","title":"Deterministic Nonsmooth Nonconvex Optimization","created":"2023-02-16","cited_by_count":26,"area":null},{"id":"2106.15212","title":"Counterfactual Explanations for Arbitrary Regression Models","created":"2021-06-29","cited_by_count":22,"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":"2305.17805","title":"The Computational Complexity of Single-Player Imperfect-Recall Games","created":"2023-05-28","cited_by_count":5,"area":null},{"id":"2406.15970","title":"Imperfect-Recall Games: Equilibrium Concepts and Their Complexity","created":"2024-06-23","cited_by_count":4,"area":null},{"id":"2501.08905","title":"Computing Game Symmetries and Equilibria That Respect Them","created":"2025-01-15","cited_by_count":4,"area":null},{"id":"2310.09157","title":"The Computational Complexity of Finding Stationary Points in Non-Convex Optimization","created":"2023-10-13","cited_by_count":2,"area":null},{"id":"2510.17067","title":"Convergence of Regret Matching in Potential Games and Constrained Optimization","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2601.20180","title":"On the Computational Complexity of Performative Prediction","created":"2026-01-28","cited_by_count":2,"area":null},{"id":"2111.04178","title":"Towards convergence to Nash equilibria in two-team zero-sum games","created":"2021-11-07","cited_by_count":1,"area":null},{"id":"2509.16898","title":"The Complexity of Finding Local Optima in Contrastive Learning","created":"2025-09-21","cited_by_count":1,"area":null},{"id":"2606.17000","title":"The Complexity of Min-Max Optimization for Quadratic Polynomials","created":"2026-06-15","cited_by_count":1,"area":null},{"id":"2609.22757","title":"Algorithmic Collusion and the Complexity of Information-Value-Free Equilibria","created":"2026-09-19","cited_by_count":1,"area":null},{"id":"2409.10323","title":"On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimization","created":"2024-09-16","cited_by_count":0,"area":null},{"id":"2601.21917","title":"On Approximate Computation of Critical Points","created":"2026-01-29","cited_by_count":0,"area":null},{"id":"2602.15252","title":"Decision Making under Imperfect Recall: Algorithms and Benchmarks","created":"2026-02-16","cited_by_count":0,"area":null}],"next_cursor":null}