{"total":21,"rows":[{"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":"2402.09721","title":"Generalized Principal-Agent Problem with a Learning Agent","created":"2024-02-15","cited_by_count":6,"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":"2502.18582","title":"Learning and Computation of $\\Phi$-Equilibria at the Frontier of Tractability","created":"2025-02-25","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":"2406.19824","title":"Learning to Mitigate Externalities: the Coase Theorem with Hindsight Rationality","created":"2024-06-28","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":"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":"2405.20642","title":"Learning Under Moral Hazard with Instrumental Regression and Generalized Method of Moments","created":"2024-05-31","cited_by_count":0,"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":"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":"2606.04931","title":"Mean-based algorithms: A lower bound and regret","created":"2026-06-03","cited_by_count":0,"area":null},{"id":"2609.20353","title":"Minimax-Optimal Online Contract Design with Unrestricted Bounded Contracts","created":"2026-09-17","cited_by_count":0,"area":null}],"next_cursor":null}