Abstract
Motivated by a scheduling problem arising from serial sacrifice experiments, the asymptotic efficiency of irreversible adaptive allocation rules is studied. The asymptotic lower bound for the regret of an adaptive allocation rule is characterized by the minimum of a linear program. Based on a class of one-sided sequential tests, asymptotically efficient rules which achieve the lower bound are constructed. The conditions necessary for this construction are verified in the serial sacrifice scheduling problem.
Citation
Inchi Hu. C. Z. Wei. "Irreversible Adaptive Allocation Rules." Ann. Statist. 17 (2) 801 - 823, June, 1989. https://doi.org/10.1214/aos/1176347144
Information
