{"total":33,"rows":[{"id":"2109.03173","title":"Learning to Bid in Contextual First Price Auctions","created":"2021-09-07","cited_by_count":19,"area":null},{"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":"2106.03596","title":"Beyond Bandit Feedback in Online Multiclass Classification","created":"2021-06-07","cited_by_count":14,"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":"2404.09832","title":"No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints","created":"2024-04-15","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":"2304.07407","title":"Repeated Principal-Agent Games with Unobserved Agent Rewards and Perfect-Knowledge Agents","created":"2023-04-14","cited_by_count":7,"area":null},{"id":"2306.07106","title":"Adversarial Constrained Bidding via Minimax Regret Optimization with Causality-Aware Reinforcement Learning","created":"2023-06-12","cited_by_count":7,"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":"2402.07363","title":"Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions","created":"2024-02-12","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":"2302.01203","title":"Online Learning under Budget and ROI Constraints via Weak Adaptivity","created":"2023-02-02","cited_by_count":5,"area":null},{"id":"2305.17402","title":"Learning and Collusion in Multi-unit Auctions","created":"2023-05-27","cited_by_count":5,"area":null},{"id":"2308.06717","title":"Estimating and Incentivizing Imperfect-Knowledge Agents with Hidden Rewards","created":"2023-08-13","cited_by_count":5,"area":null},{"id":"2501.13358","title":"Learning to Bid in Non-Stationary Repeated First-Price Auctions","created":"2025-01-23","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":"2310.05047","title":"Online Learning in Contextual Second-Price Pay-Per-Click Auctions","created":"2023-10-08","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":"2310.09597","title":"Adaptive maximization of social welfare","created":"2023-10-14","cited_by_count":2,"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":"2505.08485","title":"BAT: Benchmark for Auto-bidding Task","created":"2025-05-13","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":"2307.05698","title":"Online Ad Procurement in Non-stationary Autobidding Worlds","created":"2023-07-10","cited_by_count":1,"area":null},{"id":"2502.04678","title":"Nearly Tight Bounds for Cross-Learning Contextual Bandits with Graphical Feedback","created":"2025-02-07","cited_by_count":1,"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":"2110.01072","title":"Active Learning for Contextual Search with Binary Feedbacks","created":"2021-10-03","cited_by_count":0,"area":null},{"id":"2304.00999","title":"Bandits for Sponsored Search Auctions under Unknown Valuation Model: Case Study in E-Commerce Advertising","created":"2023-03-31","cited_by_count":0,"area":null},{"id":"2505.02796","title":"Plan-Driven Adaptive Bidding for First-Price Auctions with Budget Constraints under Nonstationarity","created":"2025-05-05","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}],"next_cursor":null}