{"total":18,"rows":[{"id":"2208.13713","title":"Online Bidding Algorithms for Return-on-Spend Constrained Advertisers","created":"2022-08-29","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":"2211.06358","title":"Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions","created":"2022-11-05","cited_by_count":11,"area":null},{"id":"2205.14572","title":"No-regret Learning in Repeated First-Price Auctions with Budget Constraints","created":"2022-05-29","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":"2401.01857","title":"Optimal cross-learning for contextual bandits with unknown context distributions","created":"2024-01-03","cited_by_count":7,"area":null},{"id":"2502.17292","title":"Joint Value Estimation and Bidding in Repeated First-Price Auctions","created":"2025-02-24","cited_by_count":6,"area":null},{"id":"2206.01293","title":"Incrementality Bidding via Reinforcement Learning under Mixed and Delayed Rewards","created":"2022-06-02","cited_by_count":5,"area":null},{"id":"2202.13710","title":"Best of Many Worlds Guarantees for Online Learning with Knapsacks","created":"2022-02-28","cited_by_count":4,"area":null},{"id":"2407.01566","title":"A Parametric Contextual Online Learning Theory of Brokerage","created":"2024-05-22","cited_by_count":4,"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":"2503.03195","title":"Online Bidding under RoS Constraints without Knowing the Value","created":"2025-03-05","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":"2605.01756","title":"The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions","created":"2026-05-03","cited_by_count":2,"area":null},{"id":"2605.09448","title":"Learning to Bid with Unknown Private Values in Budget-Constrained First-Price Auctions","created":"2026-05-10","cited_by_count":1,"area":null},{"id":"2606.25170","title":"Minimax PAC Bounds for Learning in Exogenous Contextual MDPs","created":"2026-06-23","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}