An Asymptotic Minimax Theorem for the Two Armed Bandit Problem
From MaRDI portal
Publication:3269564
DOI10.1214/aoms/1177705907zbMath0093.15701MaRDI QIDQ3269564
Publication date: 1960
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177705907
Related Items
Unnamed Item, Unnamed Item, Sequentielle Versuchspläne, Unnamed Item, Poissonian two-armed bandit: a new approach, One-armed bandit problem for parallel data processing systems, Batched bandit problems, The multi-armed bandit problem with covariates, Two-armed bandit problem for parallel data processing systems, Finding minimax strategy and minimax risk in a random environment (the two-armed bandit problem), Sequentielle Versuchs-Pläne, Robust parallel control in a random environment and data processing optimization, Two-armed bandit problem and batch version of the mirror descent algorithm, Gaussian two-armed bandit and optimization of batch data processing, Gaussian two-armed bandit: limiting description, Dynamic pricing with finite price sets: a non-parametric approach, Parallel design of robust control in the stochastic environment (the two-armed bandit problem), Ein Irrfahrten-Problem und seine Anwendung auf die Theorie der sequentiellen Versuchs-Pläne, Some problems of optimal sampling strategy, Some statistical methods in machine intelligence research, Customization of J. Bather's UCB strategy for a Gaussian multiarmed bandit, Minimax and bates strategies for the discounted infinite horizon one-armed-bandit.—explicit formulae and structural properties
