Offline Planning and Online Learning Under Recovering Rewards

Motivated by emerging applications, such as live -streaming e -commerce, promotions, and recommendations, we introduce and solve a general class of nonstationary multi -armed bandit problems that have the following two features: (i) the decision maker can pull and collect rewards from up to K(>= 1) out of N different arms in each time period and (ii) the expected reward of an arm immediately drops after it is pulled and then nonparametrically recovers as the arm's idle time increases. With the objective of maximizing the expected cumulative reward over T time periods, we design a class of purely periodic policies that jointly set a period to pull each arm. For the proposed policies, we prove performance guarantees for both the offline and the online problems. For the offline problem when all model parameters are known, the proposed periodic policy root ffiffififfi obtains a long -run approximation ratio that is at the order of 1 ? O(1= K ), which is asymptotically optimal when K grows to infinity. For the online problem when the model parameters are unknown and need to be dynamically learned, we integrate the offline periodic policy with the upper confidence bound procedure to construct on online policy. root ffiffiffi The proposed online policy is proved to approximately have Oe(N T ) regret against the offline benchmark. Our framework and policy design may shed light on broader offline planning and online learning applications with nonstationary and recovering rewards.