Monte Carlo Rollout Policy for Recommendation Systems with Dynamic User Behavior

02/08/2021

∙

by   Rahul Meshram, et al.

∙

0

∙

share

We model online recommendation systems using the hidden Markov multi-state restless multi-armed bandit problem. To solve this we present Monte Carlo rollout policy. We illustrate numerically that Monte Carlo rollout policy performs better than myopic policy for arbitrary transition dynamics with no specific structure. But, when some structure is imposed on the transition dynamics, myopic policy performs better than Monte Carlo rollout policy.