Results 1 to 10 of about 2,867 (224)
A Fast-Pivoting Algorithm for Whittle’s Restless Bandit Index [PDF]
Mathematics, 2020 The Whittle index for restless bandits (two-action semi-Markov decision processes) provides an intuitively appealing optimal policy for controlling a single generic project that can be active (engaged) or passive (rested) at each decision epoch, and ...
José Niño-Mora
doaj +6 more sources
On the computation of Whittle’s index for Markovian restless bandits [PDF]
Mathematical Methods of Operations Research, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Manu Gupta +2 more
exaly +3 more sources
On the Optimality of the Whittle’s Index Policy for Minimizing the Age of Information [PDF]
IEEE Transactions on Wireless Communications, 2021 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
Testing indexability and computing Whittle and Gittins index in subcubic time
Mathematical Methods of Operations Research, 2023 Mathematical Methods of Operations Research ...
Nicolas Gast +2 more
exaly +6 more sources
Tabular and Deep Learning for the Whittle Index
ACM Transactions on Modeling and Performance Evaluation of Computing SystemsThe 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). In this article, we present QWI and QWINN, two reinforcement learning algorithms, respectively tabular and deep, to learn ...
Konstantin Avrachenkov +2 more
exaly +5 more sources
Whittle Index Policy for Multichannel Scheduling in Queueing Systems [PDF]
2019 IEEE International Symposium on Information Theory (ISIT), 2019 extended version of a paper submitted to a ...
Saad Kriouile, Mohamad Assaad
exaly +4 more sources
A learning algorithm for the Whittle index policy for scheduling web crawlers [PDF]
2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2019 We 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 LSPE(0). The scheme leverages the known structural properties of the Whittle index policy.
Konstantin Avrachenkov, Vivek Borkar
exaly +3 more sources
IEEE Transactions on Information Theory, 2010 submitted to IEEE Transactions on Information ...
Qing Zhao
exaly +3 more sources
Whittle index approach to opportunistic scheduling with partial channel information [PDF]
Performance Evaluation, 2019 Abstract Opportunistic scheduling in wireless cellular systems utilizes random channel quality variations in time by favoring the users with good channel conditions. However, the success of such schedulers is heavily depending on the accuracy of the available information on the channel states of users.
Ianire Taboada +2 more
exaly +4 more sources
A Whittle's Index Based Approach for QoE Optimization in Wireless Networks [PDF]
Proceedings of the ACM on Measurement and Analysis of Computing Systems, 2018 The design of schedulers to optimize heterogeneous users' Quality of Experience (QoE) remains a challenging and important problem for wireless systems. This paper explores three inter-related aspects of this problem: 1) non-linear relationships between a user's QoE and flow delays; 2) managing load dependent QoE trade-offs among heterogeneous ...
Gustavo De Veciana
exaly +3 more sources