NDLI: A restless bandit with no observable states for recommendation systems and communication link scheduling

Content Provider	IEEE Xplore Digital Library
Author	Meshram, Rahul Manjunath, D. Gopalan, Aditya
Copyright Year	2015
Description	Author affiliation: Deptt. of Elecl. Commun. Engg., Indian Inst. of Science, Bangalore INDIA (Gopalan, Aditya) \|\| Deptt. of Elecl. Engg., IIT Bombay, Mumbai INDIA (Meshram, Rahul; Manjunath, D.)
Abstract	A restless bandit is used to model a user's interest in a topic or item. The interest evolves as a Markov chain whose transition probabilities depend on the action (display the ad or desist) in a time step. A unit reward is obtained if the ad is displayed and if the user clicks on the ad. If no ad is displayed then a fixed reward is assumed. The probability of click-through is determined by the state of the Markov chain. The recommender never gets to observe the state but in each time step it has a belief, denoted by πt; about the state of the Markov chain. πt evolves as a function of the action and the signal from each state. For the one-armed restless bandit with two states, we characterize the policy that maximizes the infinite horizon discounted reward. We first characterize the value function as a function of the system parameters and then characterize the optimal policies for different ranges of the parameters. We will see that the Gilbert-Elliot channel in which the two states have different success probabilities becomes a special case. For one special case, we argue that the optimal policy is of the threshold type with one threshold; extensive numerical results indicate that this may be true in general.
Starting Page	7820
Ending Page	7825
File Size	350862
Page Count	6
File Format	PDF
e-ISBN	9781479978861
DOI	10.1109/CDC.2015.7403456
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-12-15
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Markov processes History Transmitters Linear programming Process control Analytical models Context modeling
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Indexability and whittle index for restless bandit problems involving reset processes

Regret bounds for restless markov bandits.

Logarithmic weak regret of non-Bayesian restless multi-armed bandit

Linear programming relaxation algorithm for scheduling problem with controllable processing times

Decentralized control of partially observable Markov decision processes

Construction of embedded Markov decision processes for optimal control of non-linear systems with continuous state spaces

State-feedback stabilization of Markov jump linear systems with randomly observed markov states

Regret Bounds for Restless Markov Bandits

Exploiting channel memory for multi-user wireless scheduling without channel measurement: Capacity regions and algorithms

A restless bandit with no observable states for recommendation systems and communication link scheduling

Similar Documents

Indexability and whittle index for restless bandit problems involving reset processes

Regret bounds for restless markov bandits.

Logarithmic weak regret of non-Bayesian restless multi-armed bandit

Linear programming relaxation algorithm for scheduling problem with controllable processing times

Decentralized control of partially observable Markov decision processes

Construction of embedded Markov decision processes for optimal control of non-linear systems with continuous state spaces

State-feedback stabilization of Markov jump linear systems with randomly observed markov states

Regret Bounds for Restless Markov Bandits

Exploiting channel memory for multi-user wireless scheduling without channel measurement: Capacity regions and algorithms

A restless bandit with no observable states for recommendation systems and communication link scheduling