Monte Carlo Rollout Policy for Recommendation Systems with Dynamic User Behavior
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。