{"total":18,"rows":[{"id":"2202.00628","title":"Regret Minimization with Performative Feedback","created":"2022-02-01","cited_by_count":40,"area":null},{"id":"2304.06879","title":"Performative Prediction with Neural Networks","created":"2023-04-14","cited_by_count":34,"area":null},{"id":"2302.06280","title":"Causal Strategic Classification: A Tale of Two Shifts","created":"2023-02-13","cited_by_count":30,"area":null},{"id":"2305.18728","title":"Plug-in Performative Optimization","created":"2023-05-30","cited_by_count":22,"area":null},{"id":"2205.15765","title":"Strategic Classification with Graph Neural Networks","created":"2022-05-31","cited_by_count":14,"area":null},{"id":"2302.04336","title":"Performative Recommendation: Diversifying Content via Strategic Incentives","created":"2023-02-08","cited_by_count":12,"area":null},{"id":"2305.01094","title":"Performative Prediction with Bandit Feedback: Learning through Reparameterization","created":"2023-05-01","cited_by_count":11,"area":null},{"id":"2206.02953","title":"Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization","created":"2022-06-07","cited_by_count":10,"area":null},{"id":"2107.05911","title":"Model Transferability With Responsive Decision Subjects","created":"2021-07-13","cited_by_count":9,"area":null},{"id":"2210.05995","title":"SGDA with shuffling: faster convergence for nonconvex-P{\\L} minimax optimization","created":"2022-10-12","cited_by_count":8,"area":null},{"id":"2108.00473","title":"Derivative-free Alternating Projection Algorithms for General Nonconvex-Concave Minimax Problems","created":"2021-08-01","cited_by_count":7,"area":null},{"id":"2402.15188","title":"Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions","created":"2024-02-23","cited_by_count":2,"area":null},{"id":"2408.12209","title":"Zeroth-Order Stochastic Mirror Descent Algorithms for Minimax Excess Risk Optimization","created":"2024-08-22","cited_by_count":1,"area":null},{"id":"2503.18224","title":"A Framework for Finding Local Saddle Points in Two-Player Zero-Sum Black-Box Games","created":"2025-03-23","cited_by_count":1,"area":null},{"id":"2508.12479","title":"EXOTIC: An Exact, Optimistic, Tree-Based Algorithm for Min-Max Optimization","created":"2025-08-17","cited_by_count":1,"area":null},{"id":"2302.01421","title":"Follower Agnostic Methods for Stackelberg Games","created":"2023-02-02","cited_by_count":0,"area":null},{"id":"2407.02279","title":"How to Boost Any Loss Function","created":"2024-07-02","cited_by_count":0,"area":null},{"id":"2602.23277","title":"Zeroth-Order Stackelberg Control in Combinatorial Congestion Games","created":"2026-02-26","cited_by_count":0,"area":null}],"next_cursor":null}