Online Learning of Rested and Restless Bandits

Details Online Learning of Rested and Restless Bandits Online Learning of Rested and Restless Bandits

2011-02-17

arxiv.org/abs/1102.3508v1

Mathematics

Optimization and Control

Scientific paper

In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K finite-state discrete-time Markov chains (arms) with unknown state spaces and statistics. At each time step the player can play M arms. The objective of the user is to decide for each step which M of the K arms to play over a sequence of trials so as to maximize its long term reward. The restless multiarmed bandit is particularly relevant to the application of opportunistic spectrum access (OSA), where a (secondary) user has access to a set of K channels, each of time-varying condition as a result of random fading and/or certain primary users' activities.

Affiliated with

Also associated with

No associations

Rating

Online Learning of Rested and Restless Bandits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Online Learning of Rested and Restless Bandits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Online Learning of Rested and Restless Bandits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-380274