Bandits for Sponsored Search Auctions under Unknown Valuation Model: Case Study in E-Commerce Advertising
This paper presents a bidding system for sponsored search auctions under an unknown valuation model. This formulation assumes that the bidder's value is unknown, evolving arbitrarily, and observed only upon winning an auction. Unlike previous studies, we do not impose any assumptions on the nature of feedback and consider the problem of bidding in sponsored search auctions in its full generality. Our system is based on a bandit framework that is resilient to the black-box auction structure and delayed and batched feedback. To validate our proposed solution, we conducted a case study at Zalando, a leading fashion e-commerce company. We outline the development process and describe the promising outcomes of our bandits-based approach to increase profitability in sponsored search auctions. We discuss in detail the technical challenges that were overcome during the implementation, shedding light on the mechanisms that led to increased profitability.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Designing Truthful Contextual Multi-Armed Bandits based Sponsored Search Auctions
For sponsored search auctions, we consider contextual multi-armed bandit problem in the presence of strategic agents. In this setting, at each round, an advertising platform (center) runs an auction to select the best-su…
Multi-Armed BanditsBid Prediction in Repeated Auctions with Learning
We consider the problem of bid prediction in repeated auctions and evaluate the performance of econometric methods for learning agents using a dataset from a mainstream sponsored search auction marketplace. Sponsored sea…
BIG-bench Machine LearningEconometricsPredictionTime Series AnalysisThe (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions
Existing auto-bidding algorithms in digital advertising often treat the value of an ad opportunity as the revenue obtained when an ad is shown and/or clicked, and bid accordingly. This can lead to wasteful spending becau…
Learning to Bid Without Knowing your Value
We address online learning in complex auction settings, such as sponsored search auctions, where the value of the bidder is unknown to her, evolving in an arbitrary manner and observed only if the bidder wins an allocati…
Optimal cross-learning for contextual bandits with unknown context distributions
We consider the problem of designing contextual bandit algorithms in the ``cross-learning'' setting of Balseiro et al., where the learner observes the loss for the action they play in all possible contexts, not just the …
Multi-Armed Bandits