| Document Date: 2014-06-20 12:31:45
Open Document File Size: 318,23 KBShare Result on Facebook
City New York / Philadelphia / / Company Stavrogiannis L. C. / MIT Press / Multi-Agent Systems / Wellman / Cox / Lueker / Microsoft / / Country Jordan / United States / United Kingdom / / Currency USD / / / Facility University of Southampton / / IndustryTerm consistent algorithm / Online Advertising / online learning / online optimisation / advertising agent / theoretical optimal solution / sponsored search auctions / compare bidding algorithms / real time deployment / online stochastic knapsack problem / particular algorithm / on-line knapsack problems / sponsored search auction problems / censored data solutions / deterministic solution / sponsored-search auctions / sponsored search auction problem / sponsored search / advertising auctions / sponsored search auction database / search engines / Online Bid Optimisation / heuristic algorithms / online keyword bidding auctions / e - commerce / real sponsored search auctions / stochastic solution / search engine / online bid optimisation problem / Internet activities / / OperatingSystem Windows 7 / / Organization MIT / American Statistical Society / Society for Industrial and Applied Mathematics / Japan Statistical Society / University of Southampton / / Person Mansour / Bt / Van Ryzin / / Position setting rt / tackle the budget / rt / profit rt / / ProvinceOrState New York / Connecticut / / Technology three algorithms / RAM / computationally expensive algorithm / LuekerLearn algorithm / search engine / operating system / 4.2 The GPL Algorithm The GPL algorithm / two algorithms / 4.3 Algorithm / particular algorithm / proposed algorithm / artificial intelligence / aforementioned algorithms / compare bidding algorithms / 4 Algorithms / / URL http /
SocialTag |
Efficient Regret Bounds for Online Bid Optimisation in Budget-Limited Sponsored Search Auctions Long Tran-Thanh1 , Lampros Stavrogiannis1 , Victor Naroditskiy1 Valentin Robu1 , Nicholas R Jennings1 and Peter Key2 1: Univ