{"total":43,"rows":[{"id":"2205.08562","title":"Strategizing against Learners in Bayesian Games","created":"2022-05-17","cited_by_count":34,"area":null},{"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":"2110.11855","title":"Auctions Between Regret-Minimizing Agents","created":"2021-10-22","cited_by_count":22,"area":null},{"id":"2111.14737","title":"Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update","created":"2021-11-29","cited_by_count":20,"area":null},{"id":"2305.19496","title":"Is Learning in Games Good for the Learners?","created":"2023-05-31","cited_by_count":20,"area":null},{"id":"2112.07640","title":"How and Why to Manipulate Your Own Agent: On the Incentives of Users of Learning Agents","created":"2021-12-14","cited_by_count":17,"area":null},{"id":"2502.09332","title":"Full Swap Regret and Discretized Calibration","created":"2025-02-13","cited_by_count":15,"area":null},{"id":"2302.01523","title":"Multi-channel Autobidding with Budget and ROI Constraints","created":"2023-02-03","cited_by_count":14,"area":null},{"id":"2406.10631","title":"Fast Last-Iterate Convergence of Learning in Games Requires Forgetful Algorithms","created":"2024-06-15","cited_by_count":14,"area":null},{"id":"2210.07773","title":"Diversified Recommendations for Agents with Adaptive Preferences","created":"2022-09-20","cited_by_count":9,"area":null},{"id":"2110.03906","title":"Nash Convergence of Mean-Based Learning Algorithms in First-Price Auctions","created":"2021-10-08","cited_by_count":8,"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":"2302.03719","title":"Persuading a Behavioral Agent: Approximately Best Responding and Learning","created":"2023-02-07","cited_by_count":7,"area":null},{"id":"2409.03956","title":"Algorithmic Collusion Without Threats","created":"2024-09-06","cited_by_count":7,"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":"2502.00204","title":"Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information","created":"2025-01-31","cited_by_count":6,"area":null},{"id":"2305.17402","title":"Learning and Collusion in Multi-unit Auctions","created":"2023-05-27","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":"2406.07585","title":"Rate-Preserving Reductions for Blackwell Approachability","created":"2024-06-10","cited_by_count":4,"area":null},{"id":"2302.08012","title":"Equilibrium of Data Markets with Externality","created":"2023-02-16","cited_by_count":3,"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":"2205.14519","title":"Online Learning with Bounded Recall","created":"2022-05-28","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":"2509.11357","title":"Online Omniprediction with Long-Term Constraints","created":"2025-09-14","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":"2302.09700","title":"Leveraging Reviews: Learning to Price with Buyer and Seller Uncertainty","created":"2023-02-20","cited_by_count":1,"area":null},{"id":"2307.05698","title":"Online Ad Procurement in Non-stationary Autobidding Worlds","created":"2023-07-10","cited_by_count":1,"area":null},{"id":"2406.18805","title":"Online Stackelberg Optimization via Nonlinear Control","created":"2024-06-27","cited_by_count":1,"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":"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":"2609.22757","title":"Algorithmic Collusion and the Complexity of Information-Value-Free Equilibria","created":"2026-09-19","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},{"id":"2603.22348","title":"Learning Safely Without Knowing the World:COMPASS-Hedge","created":"2026-03-22","cited_by_count":0,"area":null},{"id":"2606.04931","title":"Mean-based algorithms: A lower bound and regret","created":"2026-06-03","cited_by_count":0,"area":null}],"next_cursor":null}