Results 211 to 220 of about 3,394 (246)
Testing indexability and computing Whittle and Gittins index in subcubic time
Whittle index is a generalization of Gittins index that provides very efficient allocation rules for restless multi-armed bandits. In this work, we develop an algorithm to test the indexability and compute the Whittle indices of any finite-state restless
Nicolas Gast +2 more
exaly +7 more sources
Whittle Index Policy for Crawling Ephemeral Content [PDF]
International audienceWe consider the task of scheduling a crawler to retrieve from several sites their ephemeral content. This is content, such as news or posts at social network groups, for which a user typically loses interest after some days or hours.
Konstantin Avrachenkov, Vivek S Borkar
exaly +9 more sources
Exponential asymptotic optimality of Whittle index policy
International audienceWe evaluate the performance of Whittle index policy for restless Markovian bandit. It is shown in Weber and Weiss (J Appl Probab 27(3):637–648, 1990) that if the bandit is indexable and the associated deterministic system has a ...
Nicolas Gast, Bruno Gaujal, Chen Yan
exaly +6 more sources
Tabular and Deep Learning for the Whittle Index
International audienceThe Whittle index policy is a heuristic that has shown remarkably good performance (with guaranteed asymptotic optimality) when applied to the class of problems known as Restless Multi-Armed Bandit Problems (RMABPs).
FRANCISCO Robledo +2 more
exaly +6 more sources
A learning algorithm for the Whittle index policy for scheduling web crawlers [PDF]
International audienceWe revisit the Whittle index policy for scheduling web crawlers for ephemeral content proposed in Avrachenkov and Borkar, IEEE Trans. Control of Network Systems 5(1), 2016, and develop a reinforcement learning scheme for it based on
Konstantin Avrachenkov, Vivek S Borkar
exaly +5 more sources
On the computation of Whittle’s index for Markovian restless bandits [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manu K Gupta, Ina Maria Verloop
exaly +3 more sources
On the Optimality of the Whittle’s Index Policy for Minimizing the Age of Information [PDF]
In this paper, we consider the average age minimization problem where a central entity schedules M users among the N available users for transmission over unreliable channels. It is well-known that obtaining the optimal policy, in this case, is out of reach.
Ali Maatouk +2 more
exaly +3 more sources
Whittle index based Q-learning for restless bandits with average reward [PDF]
International audienceA novel reinforcement learning algorithm is introduced for multiarmed restless bandits with average reward, using the paradigms of Q-learning and Whittle index.
Konstantin Avrachenkov, Vivek S Borkar
exaly +2 more sources
Whittle Index Policy for Dynamic Multichannel Allocation in Remote State Estimation
In this paper, we consider dynamic channel allocation for remote state estimation of multiagent systems. For each subsystem, a sensor measures its state and transmits the data via a packet-dropping channel, which is dynamically allocated by the remote ...
Jiazheng Wang +2 more
exaly +2 more sources

