{"total":19,"rows":[{"id":"2310.19647","title":"Fast swap regret minimization and applications to approximate correlated equilibria","created":"2023-10-30","cited_by_count":32,"area":null},{"id":"2401.16198","title":"Contracting with a Learning Agent","created":"2024-01-29","cited_by_count":23,"area":null},{"id":"2502.09332","title":"Full Swap Regret and Discretized Calibration","created":"2025-02-13","cited_by_count":15,"area":null},{"id":"2402.08637","title":"Strategizing against No-Regret Learners in First-Price Auctions","created":"2024-02-13","cited_by_count":8,"area":null},{"id":"2407.04889","title":"Maximizing utility in multi-agent environments by anticipating the behavior of other learners","created":"2024-07-05","cited_by_count":8,"area":null},{"id":"2502.20229","title":"Swap Regret and Correlated Equilibria Beyond Normal-Form Games","created":"2025-02-27","cited_by_count":8,"area":null},{"id":"2402.09721","title":"Generalized Principal-Agent Problem with a Learning Agent","created":"2024-02-15","cited_by_count":6,"area":null},{"id":"2506.01936","title":"Should Decision-Makers Reveal Classifiers in Online Strategic Classification?","created":"2025-06-02","cited_by_count":5,"area":null},{"id":"2406.07585","title":"Rate-Preserving Reductions for Blackwell Approachability","created":"2024-06-10","cited_by_count":4,"area":null},{"id":"2405.20880","title":"Games with Payments between Learning Agents","created":"2024-05-31","cited_by_count":3,"area":null},{"id":"2412.18297","title":"Learning to Play Against Unknown Opponents","created":"2024-12-24","cited_by_count":3,"area":null},{"id":"2502.11673","title":"Best of Both Worlds: Regret Minimization versus Minimax Play","created":"2025-02-17","cited_by_count":2,"area":null},{"id":"2503.04202","title":"Computational Intractability of Strategizing against Online Learners","created":"2025-03-06","cited_by_count":2,"area":null},{"id":"2601.03853","title":"From No-Regret to Strategically Robust Learning in Repeated Auctions","created":"2026-01-07","cited_by_count":2,"area":null},{"id":"2602.08862","title":"Near-optimal Swap Regret Minimization for Convex Losses","created":"2026-02-09","cited_by_count":2,"area":null},{"id":"2411.09517","title":"Randomized Truthful Auctions with Learning Agents","created":"2024-11-14","cited_by_count":1,"area":null},{"id":"2502.08597","title":"Markets with Heterogeneous Agents: Dynamics and Survival of Bayesian vs. No-Regret Learners","created":"2025-02-12","cited_by_count":1,"area":null},{"id":"2510.22471","title":"Learning Local Stackelberg Equilibria from Repeated Interactions with a Learning Agent","created":"2025-10-26","cited_by_count":1,"area":null},{"id":"2602.12253","title":"Is Online Linear Optimization Sufficient for Strategic Robustness?","created":"2026-02-12","cited_by_count":0,"area":null}],"next_cursor":null}