Sciweavers

17 search results - page 1 / 4
» The Budgeted Multi-armed Bandit Problem
Sort
View
NIPS
2008
13 years 9 months ago
Mortal Multi-Armed Bandits
We formulate and study a new variant of the k-armed bandit problem, motivated by e-commerce applications. In our model, arms have (stochastic) lifetime after which they expire. In...
Deepayan Chakrabarti, Ravi Kumar, Filip Radlinski,...
AAAI
2010
13 years 8 months ago
Epsilon-First Policies for Budget-Limited Multi-Armed Bandits
Tran-Thanh Long, Archie C. Chapman, Enrique Munoz ...
CORR
2008
Springer
136views Education» more  CORR 2008»
13 years 7 months ago
Multi-Armed Bandits in Metric Spaces
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 7 months ago
Online Algorithms for the Multi-Armed Bandit Problem with Markovian Rewards
We consider the classical multi-armed bandit problem with Markovian rewards. When played an arm changes its state in a Markovian fashion while it remains frozen when not played. Th...
Cem Tekin, Mingyan Liu
CORR
2010
Springer
175views Education» more  CORR 2010»
13 years 2 months ago
On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
Yi Gai, Bhaskar Krishnamachari, Mingyan Liu