Optimal bidding strategies in dynamic auctions with budget constraints
2011 (English)In: Allerton Conference on Communication, Control, and Computing, 2011, 588- p.Conference paper (Refereed)
We consider the problem of a bidder with limited budget competing in a series of second-price auctions. A motivating example is that of sponsored search auctions, where advertisers bid in a sequence of repeated generalized second price auctions. To characterize the optimal bidding strategy, we formulate the problem as a discounted Markov Decision Process, and provide explicit solutions when the bidder is involved in a large number of auctions.
Place, publisher, year, edition, pages
2011. 588- p.
Budget constraint, Explicit solutions, Markov Decision Processes, Optimal bidding strategy, Second-price auction, Sponsored search auctions, Budget control, Communication, Markov processes, Optimization, Commerce
IdentifiersURN: urn:nbn:se:kth:diva-149923DOI: 10.1109/Allerton.2011.6120220ScopusID: 2-s2.0-84856089160ISBN: 9781457718168OAI: oai:DiVA.org:kth-149923DiVA: diva2:742200
2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, 28 September 2011 through 30 September 2011, Monticello, IL
QC 201409012014-09-012014-08-282014-09-01Bibliographically approved