{"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":"2306.02704","title":"Calibrated Stackelberg Games: Learning Optimal Commitments Against Calibrated Agents","created":"2023-06-05","cited_by_count":25,"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":"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.07363","title":"Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions","created":"2024-02-12","cited_by_count":7,"area":null},{"id":"2403.00188","title":"Impact of Decentralized Learning on Player Utilities in Stackelberg Games","created":"2024-02-29","cited_by_count":5,"area":null},{"id":"2408.08272","title":"Is Knowledge Power? On the (Im)possibility of Learning from Strategic Interactions","created":"2024-08-15","cited_by_count":5,"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":"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":"2602.08862","title":"Near-optimal Swap Regret Minimization for Convex Losses","created":"2026-02-09","cited_by_count":2,"area":null},{"id":"2411.06069","title":"Model Selection for Average Reward RL with Application to Utility Maximization in Repeated Games","created":"2024-11-09","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":"2407.00419","title":"On the Complexity of Learning to Cooperate with Populations of Socially Rational Agents","created":"2024-06-29","cited_by_count":0,"area":null},{"id":"2604.05129","title":"No Coin Left Behind: Maximizing Strategic Surplus Against No-Regret Dynamics","created":"2026-04-06","cited_by_count":0,"area":null},{"id":"2607.08012","title":"Provably Optimal Learning Algorithms for Assistance Games","created":"2026-07-09","cited_by_count":0,"area":null}],"next_cursor":null}