Regret Bounds for Opportunistic Channel Access

Details Regret Bounds for Opportunistic Channel Access Regret Bounds for Opportunistic Channel Access

2009-08-03

arxiv.org/abs/0908.0319v1

Statistics

Machine Learning

Scientific paper

We consider the task of opportunistic channel access in a primary system composed of independent Gilbert-Elliot channels where the secondary (or opportunistic) user does not dispose of a priori information regarding the statistical characteristics of the system. It is shown that this problem may be cast into the framework of model-based learning in a specific class of Partially Observed Markov Decision Processes (POMDPs) for which we introduce an algorithm aimed at striking an optimal tradeoff between the exploration (or estimation) and exploitation requirements. We provide finite horizon regret bounds for this algorithm as well as a numerical evaluation of its performance in the single channel model as well as in the case of stochastically identical channels.

Affiliated with

Also associated with

No associations

Rating

Regret Bounds for Opportunistic Channel Access 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 Regret Bounds for Opportunistic Channel Access, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Regret Bounds for Opportunistic Channel Access will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-454437