Optimal No-regret Learning in Repeated First-price Auctions

22 March 2020

Papers citing "Optimal No-regret Learning in Repeated First-price Auctions"

9 / 9 papers shown

Title
Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity Yige Wang Jiashuo Jiang 32 0 0 05 May 2025
Adversarial Combinatorial Semi-bandits with Graph Feedback Yuxiao Wen 80 0 0 26 Feb 2025
Stochastic contextual bandits with graph feedback: from independence number to MAS number Yuxiao Wen Yanjun Han Zhengyuan Zhou 42 1 0 12 Feb 2024
Adaptive maximization of social welfare Nicolò Cesa-Bianchi Roberto Colomboni Maximilian Kasy 30 0 0 14 Oct 2023
Bandits for Sponsored Search Auctions under Unknown Valuation Model: Case Study in E-Commerce Advertising Danil Provodin Jérémie Joudioux E. Duryev 24 0 0 31 Mar 2023
Learning to Bid in Contextual First Price Auctions Ashwinkumar Badanidiyuru Zhe Feng Guru Guruganesh 24 17 0 07 Sep 2021
Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions Yanjun Han Zhengyuan Zhou Aaron Flores E. Ordentlich Tsachy Weissman 16 40 0 09 Jul 2020
Reinforcement Learning for Non-Stationary Markov Decision Processes: The Blessing of (More) Optimism Wang Chi Cheung D. Simchi-Levi Ruihao Zhu OffRL 14 93 0 24 Jun 2020
Adaptive Discretization for Adversarial Lipschitz Bandits Chara Podimata Aleksandrs Slivkins 12 16 0 22 Jun 2020