Affiliation:
1. University of Illinois at Urbana Champaign, Urbana, IL
Abstract
We consider online auctions from the point of view of a single bidder who has an average budget constraint. By modeling the rest of the bidders through a probability distribution (often referred to as the mean-field approximation), we develop a simple bidding strategy which can be implemented without any statistical knowledge of bids, valuations, and query arrival processes. The key idea is to use stochastic approximation techniques to automatically track long-term averages.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Convexity in Real-time Bidding and Related Problems;ACM Transactions on Economics and Computation;2024-06-10
2. Optimal Bidding Strategies for Online Ad Auctions with Overlapping Targeting Criteria;ACM SIGMETRICS Performance Evaluation Review;2020-07-08
3. Optimal Bidding Strategies for Online Ad Auctions with Overlapping Targeting Criteria;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2020-06-09
4. Optimal Bidding Strategies for Online Ad Auctions with Overlapping Targeting Criteria;Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems;2020-06-08
5. Optimization of Operational Decisions in Digital Advertising: A Literature Review;Springer Series in Supply Chain Management;2019-12-15