Results 11 to 20 of about 3,394 (246)
QWI: Q-learning with Whittle Index [PDF]
ACM SIGMETRICS Performance Evaluation Review, 2021 International audienceThe Whittle index policy is a heuristic that has shown remarkable good performance (with guaranted asymptotic optimality) when applied to the class of problems known as multi-armed restless bandits.
Ayesta, Urtzi +3 more
core +3 more sources
Whittle index approach to energy-aware dispatching [PDF]
2018 30th International Teletraffic Congress (ITC 30), 2018 A data center can be modeled as a set of parallel queues, and the dispatcher decides to which queue the arriving jobs are routed. We consider an energy-aware dispatching system in a Markovian setting, where each server upon becoming empty enters a sleep ...
Aalto, Samuli +3 more
core +3 more sources
A Whittle Index Approach to Minimizing Functions of Age of Information [PDF]
IEEE/ACM Transactions on Networking, 2021 © 2019 IEEE. We consider a setting where multiple active sources send real-time updates over a single-hop wireless broadcast network to a monitoring station.
Tripathi, Vishrant, Modiano, Eytan
core +4 more sources
Scheduling in Wireless Networks using Whittle Index Theory
2022 National Conference on Communications (NCC), 2022 We consider the problem of scheduling packet transmissions in a wireless network of users while minimizing the energy consumed and the transmission delay.
Borkar, Vivek S. +2 more
core +3 more sources
Two families of indexable partially observable restless bandits and Whittle index computation
SSRN Electronic Journal, 2023 We consider the restless bandits with general state space under partial observability with two observational models: first, the state of each bandit is not observable at all, and second, the state of each bandit is observable only if it is chosen.
Akbarzadeh, Nima, Mahajan, Aditya
core +2 more sources
Whittle index approach to opportunistic scheduling with partial channel information [PDF]
Performance Evaluation, 2021 Opportunistic scheduling in wireless cellular systems utilizes random channel quality variations in time by favoring the users with good channel conditions.
Aalto, Samuli +2 more
core +4 more sources
Towards Q-learning the whittle index for restless bandits
2019 Australian & New Zealand Control Conference (ANZCC), 2019 We consider the multi-armed restless bandit problem (RMABP) with an infinite horizon average cost objective. Each arm of the RMABP is associated with a Markov process that operates in two modes: active and passive. At each time slot a controller needs to
Jing Fu +7 more
core +4 more sources
On the Whittle index of Markov Modulated Restless Bandits
Queueing Systems, 2022 International audienceIn this paper we study a Multi-Armed Restless Bandit Problem (MARBP) subject to time fluctuations. This model has numerous applications in practice, like in cloud computing systems or in wireless communications networks. Each bandit
Duran, Santiago Guillermo +2 more
core +5 more sources
A Novel Implementation of Q-Learning for the Whittle Index
, 2021 We develop a method for learning index rules for multi-armed bandits, restless bandits, and dynamic resource allocation where the underlying transition probabilities and reward structure of the system is not known. Our approach builds on an understanding
Jacko, Peter +2 more
core +4 more sources
On the Whittle Index for Restless Multiarmed Hidden Markov Bandits [PDF]
IEEE Transactions on Automatic Control, 2018 We consider a restless multiarmed bandit in which each arm can be in one of two states. When an arm is sampled, the state of the arm is not available to the sampler. Instead, a binary signal with a known randomness that depends on the state of the arm is
Meshram, Rahul +7 more
core +6 more sources