Monte Carlo Rollout Policy for Recommendation Systems with Dynamic User Behavior
2021 International Conference on COMmunication Systems & NETworkS (COMSNETS)(2021)
摘要
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.
更多查看译文
关键词
Monte Carlo rollout policy,model online recommendation systems,hidden Markov multistate restless multiarmed bandit problem,myopic policy
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要