Sciweavers

97 search results - page 2 / 20
» Randomized algorithms for online bounded bidding
Sort
View
IJCAI
2001
13 years 7 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...
WWW
2009
ACM
14 years 7 months ago
Adaptive bidding for display advertising
Motivated by the emergence of auction-based marketplaces for display ads such as the Right Media Exchange, we study the design of a bidding agent that implements a display adverti...
Arpita Ghosh, Benjamin I. P. Rubinstein, Sergei Va...
COLT
2006
Springer
13 years 10 months ago
A Randomized Online Learning Algorithm for Better Variance Control
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
Jean-Yves Audibert
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 3 months ago
Selective Call Out and Real Time Bidding
Display ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each ti...
Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Y...