On Sequential Designs for Maximizing the Sum of $n$ Observations

DOI10.1214/aoms/1177728073zbMath0073.14203OpenAlexW2036075699MaRDI QIDQ3234931

Russell N. Bradt, Selmer Johnson, Samuel Karlin

Publication date: 1956

Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoms/1177728073

zbMATH Keywords

Statistics

Related Items (30)

Adaptive competitive decision in repeated play of a matrix game with uncertain entries ⋮ Optimistic Gittins Indices ⋮ Ein Irrfahrten-Problem und seine Anwendung auf die Theorie der sequentiellen Versuchs-Pläne ⋮ Some problems of optimal sampling strategy ⋮ Sequentielle Versuchspläne ⋮ On a theorem of Kelley ⋮ Covariate models for bernoulli bandits ⋮ A central limit theorem, loss aversion and multi-armed bandits ⋮ A perpetual search for talents across overlapping generations: a learning process ⋮ Bernoulli two-armed bandits with geometric termination ⋮ A confirmation of a conjecture on Feldman’s two-armed bandit problem ⋮ A limit property of sequential decision process ⋮ Strategic learning in teams ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Dynamic priority allocation via restless bandit marginal productivity indices ⋮ Herbert Robbins and sequential analysis ⋮ On Bayesian index policies for sequential resource allocation ⋮ A Two-Armed Bandit Problem with possibility of no Information ⋮ On the optimal amount of experimentation in sequential decision problems ⋮ The apparent conflict between estimation and control - a survey of the two-armed bandit problem ⋮ An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits ⋮ On the two armed bandit with one probability known ⋮ Learning to signal: Analysis of a micro-level reinforcement model ⋮ Comparison of two Bernoulli processes by multiple stage sampling using Bayesian decision theory ⋮ On monotone optimal decision rules and the stay-on-a-winner rule for the two-armed bandit ⋮ Sequentielle Versuchs-Pläne ⋮ Dynamic allocation policies for the finite horizon one armed bandit problem ⋮ Small-sample performance of Bernoulli two-armed bandit Bayesian strategies ⋮ One-armed bandit problem for parallel data processing systems

This page was built for publication: On Sequential Designs for Maximizing the Sum of $n$ Observations