Setting Reserve Prices in Second-Price Auctions with Unobserved Bids

DOI10.1287/ijoc.2022.1199OpenAlexW4288712582MaRDI QIDQ5060778

Jason Rhuggenaath, Alp Akcay, Uzay Kaymak, Ying-Qian Zhang

Publication date: 11 January 2023

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2022.1199

zbMATH Keywords

online learningsecond-price auctionsonline advertisingreserve pricemultiarmed bandits

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
• Improving multi-armed bandit algorithms in online pricing settings
• An Automated and Data-Driven Bidding Strategy for Online Auctions
• Regret Minimization for Reserve Prices in Second-Price Auctions
• Dynamic Pricing and Learning with Finite Inventories
• Optimal Budget Allocation Across Search Advertising Markets
• Technical Note—Dynamic Pricing and Demand Learning with Limited Price Experimentation
• The Nonstochastic Multiarmed Bandit Problem
• 10.1162/153244303321897663
• Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards
• A New Approach to Real-Time Bidding in Online Advertisements: Auto Pricing Strategy
• Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
• Chasing Demand: Learning and Earning in a Changing Environment
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: Setting Reserve Prices in Second-Price Auctions with Unobserved Bids