In a multi-armed bandit (MAB) problem a gambler needs to choose at each round of play one of K arms, each characterized by an unknown reward distribution. Reward realizations are only observed when an arm is selected, and the gambler's objective is to maximize cumulative expected earnings over...

We consider a non-stationary variant of a sequential stochastic optimization problem, where the underlying cost functions may change along the horizon. We propose a measure, termed variation budget, that controls the extent of said change, and study how restrictions on this budget impact...

A new class of online services allows internet media sites to direct users from articles they are currently reading to other content they may be interested in. This process creates a "browsing path'' along which there is potential for repeated interaction between the user and the provider,...

In a multi-armed bandit (MAB) problem a gambler needs to choose at each round of play one of K arms, each characterized by an unknown reward distribution. Reward realizations are only observed when an arm is selected, and the gambler's objective is to maximize his cumulative expected earnings...

A new class of online services allows publishers to direct readers from articles they are currently reading to other web-based content they may be interested in. A key feature of such a dynamic recommendation service is that users interact with the provider along their browsing path. While the...