Monotone stopping-allocation problems

DOI10.2307/1427510MaRDI QIDQ5202953zbMATH OpenOpenAlexFDO

Authors Robert A. Benhenni

Publication date 1991

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1427510

zbMATH Keywords

stopping rulemulti-armed bandit problemsinspection problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic learning and adaptive control (93E35)

Recommendations

• Optimal stopping and dynamic allocation
• On the improvement of allocation rules for multi-armed bandit problem
• Optimal stopping problems for multiarmed bandit processes with arms' independence
• scientific article; zbMATH DE number 3862967
• Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards

Cited in

(1)

• On the improvement of allocation rules for multi-armed bandit problem

This page was built for publication: Monotone stopping-allocation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202953)