Adaptive Policies for Sequential Sampling under Incomplete Information and a Cost Constraint
classification
📊 stat.ML
cs.LGmath.OC
keywords
underaverageoutcomepoliciessamplingadaptiveclassconstraint
read the original abstract
We consider the problem of sequential sampling from a finite number of independent statistical populations to maximize the expected infinite horizon average outcome per period, under a constraint that the expected average sampling cost does not exceed an upper bound. The outcome distributions are not known. We construct a class of consistent adaptive policies, under which the average outcome converges with probability 1 to the true value under complete information for all distributions with finite means. We also compare the rate of convergence for various policies in this class using simulation.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.