基于无休多臂机的机会访问:可行性和因子策略

发布者:计算机信息发布时间:2018-08-13浏览次数:38

报告题目:基于无休多臂机的机会访问:可行性和因子策略

报告人:王克浩 副教授

单位:武汉理工大学信息工程学院

报告时间2018817周五)上午10:15

报告地点翡翠科教楼A106

  

报告人简介:王克浩于20032006年于武汉理工大学大学获得学士和硕士学位,2012年于巴黎十一大和武汉理工大学获得博士学位。2013年香港理工大学博士后。2013年进入武汉理工大学信息工程学院,任副教授,博士生导师。自201511月起,一直在麻省理工学院从事访问合作研究。主持国家自然科学基金、湖北省自然科学基金、博士后资助、晨光计划等多项。发表论文30多篇。

  

报告摘要:We revisit the opportunistic scheduling problem in which a server opportunistically serves multiple classes of users under time-varying multi-state Markovian channels. The aim of the server is to find an optimal policy minimizing the average waiting cost of those users. Mathematically, the problem can be recast to a restless multiarmed bandit one, and a pivot to solve restless bandit by the Whittle index approach is to establish indexability. Despite the theoretical and practical importance of the Whittle index policy, the indexability is still open for opportunistic scheduling in the heterogeneous multi-state channel case. To fill this gap, we mathematically identify a set of sufficient conditions on a channel state transition matrix under which the indexability is guaranteed and consequently, the Whittle index policy is feasible. Further, we obtain the closed-form Whittle index by exploiting the structural property of the channel state transition matrix. For a generic channel state transition matrix, we propose an eigenvalue-arithmetic-mean scheme to obtain the corresponding approximate matrix which satisfies the sufficient conditions, and consequently, can get an approximate Whittle index.Our work constitutes a small step toward solving the opportunistic scheduling problem in its generic form involving multi-state Markovian channels and multi-class users.