Decentralized Restless Bandit with Multiple Players and Unknown Dynamics

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages, 2 figures, in Proc. of Information Theory and Applications Workshop (ITA), January, 2011

Scientific paper

We consider decentralized restless multi-armed bandit problems with unknown dynamics and multiple players. The reward state of each arm transits according to an unknown Markovian rule when it is played and evolves according to an arbitrary unknown random process when it is passive. Players activating the same arm at the same time collide and suffer from reward loss. The objective is to maximize the long-term reward by designing a decentralized arm selection policy to address unknown reward models and collisions among players. A decentralized policy is constructed that achieves a regret with logarithmic order when an arbitrary nontrivial bound on certain system parameters is known. When no knowledge about the system is available, we extend the policy to achieve a regret arbitrarily close to the logarithmic order. The result finds applications in communication networks, financial investment, and industrial engineering.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Decentralized Restless Bandit with Multiple Players and Unknown Dynamics 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 Decentralized Restless Bandit with Multiple Players and Unknown Dynamics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decentralized Restless Bandit with Multiple Players and Unknown Dynamics will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-377891

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.