Show simple item record

dc.contributor.authorFlajolet, Arthur
dc.contributor.authorJaillet, Patrick
dc.date.accessioned2021-11-05T19:54:14Z
dc.date.available2021-11-05T19:54:14Z
dc.date.issued2017
dc.identifier.urihttps://hdl.handle.net/1721.1/137606
dc.description.abstract© 2017 Neural information processing systems foundation. All rights reserved. We consider the problem of repeated bidding in online advertising auctions when some side information (e.g. browser cookies) is available ahead of submitting a bid in the form of a d-dimensional vector. The goal for the advertiser is to maximize the total utility (e.g. the total number of clicks) derived from displaying ads given that a limited budget B is allocated for a given time horizon T. Optimizing the bids is modeled as a contextual Multi-Armed Bandit (MAB) problem with a knapsack constraint and a continuum of arms. We develop UCB-type algorithms that combine two streams of literature: the confidence-set approach to linear contextual MABs and the probabilistic bisection search method for stochastic root-finding. Under mild assumptions on the underlying unknown distribution, we establish distribution-independent regret bounds of order Õ(d · √T) when either B = ∞ or when B scales linearly with T.en_US
dc.language.isoen
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceNeural Information Processing Systems (NIPS)en_US
dc.titleReal-Time Bidding with Side Informationen_US
dc.typeArticleen_US
dc.identifier.citationFlajolet, Arthur and Jaillet, Patrick. 2017. "Real-Time Bidding with Side Information."
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Centeren_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.departmentMassachusetts Institute of Technology. Laboratory for Information and Decision Systemsen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2019-05-31T18:05:53Z
dspace.date.submission2019-05-31T18:05:54Z
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record