Approximation algorithms for restless bandit problems

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Sudipto Guha University of Pennsylvania, Philadelphia, PA
Kamesh Munagala Duke University, Durham, NC
Peng Shi Duke University, Durham, NC
Published in:
Cover Image
 
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 58 Issue 1, December 2010
Article No. 3
ACM New York, NY, USA
table of contents doi>10.1145/1870103.1870106
Approximation algorithms for restless bandit problems Published by ACM 2010 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 14
· Downloads (12 Months): 143
· Downloads (cumulative): 926
· Citation Count: 2


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder