A better resource allocation algorithm with semi-bandit feedback
From MaRDI portal
Publication:4617606
zbMATH Open1407.62296arXiv1803.10415MaRDI QIDQ4617606FDOQ4617606
Authors: Yuval Dagan, Koby Crammer
Publication date: 6 February 2019
Full work available at URL: https://arxiv.org/abs/1803.10415
Recommendations
- On Bayesian index policies for sequential resource allocation
- An Efficient Algorithm for Learning with Semi-bandit Feedback
- Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards
- Kullback-Leibler upper confidence bounds for optimal sequential allocation
- On the improvement of allocation rules for multi-armed bandit problem
Sequential statistical analysis (62L10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Compound decision problems in statistical decision theory (62C25) Optimal stopping in statistics (62L15) Probabilistic games; gambling (91A60)
Cited In (3)
This page was built for publication: A better resource allocation algorithm with semi-bandit feedback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4617606)