Whittle Index Policy for Crawling Ephemeral Content

DOI10.1109/TCNS.2016.2619066OpenAlexW4394592908MaRDI QIDQ4562366

Vivek S. Borkar, Konstantin E. Avrachenkov

Publication date: 19 December 2018

Published in: IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.08558

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (4)

Exponential asymptotic optimality of Whittle index policy ⋮ A Verification Theorem for Threshold-Indexability of Real-State Discounted Restless Bandits ⋮ Whittle index based Q-learning for restless bandits with average reward ⋮ A Restless Bandit Model for Resource Allocation, Competition, and Reservation

This page was built for publication: Whittle Index Policy for Crawling Ephemeral Content