{"total":22,"rows":[{"id":"2404.00806","title":"Algorithmic Collusion by Large Language Models","created":"2024-03-31","cited_by_count":62,"area":null},{"id":"2401.16198","title":"Contracting with a Learning Agent","created":"2024-01-29","cited_by_count":23,"area":null},{"id":"2202.05947","title":"Artificial Intelligence and Auction Design","created":"2022-02-12","cited_by_count":20,"area":null},{"id":"2209.13578","title":"Learning When to Advise Human Decision Makers","created":"2022-09-27","cited_by_count":18,"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":"2307.09478","title":"The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations","created":"2023-07-14","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":"2311.07815","title":"Cooperative AI via Decentralized Commitment Devices","created":"2023-11-14","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":"2302.11829","title":"Learning to Manipulate a Commitment Optimizer","created":"2023-02-23","cited_by_count":3,"area":null},{"id":"2307.15193","title":"Learning in Repeated Multi-Unit Pay-As-Bid Auctions","created":"2023-07-27","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":"2310.09597","title":"Adaptive maximization of social welfare","created":"2023-10-14","cited_by_count":2,"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":"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":"2502.08898","title":"Learning in Strategic Queuing Systems with Small Buffers","created":"2025-02-13","cited_by_count":1,"area":null},{"id":"2511.21935","title":"Breaking Algorithmic Collusion in Human-AI Ecosystems","created":"2025-11-26","cited_by_count":1,"area":null},{"id":"2411.01720","title":"Barriers to Welfare Maximization with No-Regret Learning","created":"2024-11-04","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}