12 search results - page 2 / 3 » Finite-time Analysis of the Multiarmed Bandit Problem |
194
Voted
Publication
In pay-per click sponsored search auctions which are cur-
rently extensively used by search engines, the auction for
a keyword involves a certain number of advertisers (say k)
c...
106
Voted
ALT
2007
Springer
16 years 19 days ago
2007
Springer
Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. In this p...
153
Voted
WIOPT
2011
IEEE
14 years 7 months ago
2011
IEEE
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
139
Voted
COLT
2008
Springer
15 years 5 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
125
Voted
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
We analyze the problem of designing a truthful pay-per-click auction where the click-through-rates (CTR) of the bidders are unknown to the auction. Such an auction faces the class...