Hostname: page-component-89b8bd64d-7zcd7 Total loading time: 0 Render date: 2026-05-08T18:38:39.685Z Has data issue: false hasContentIssue false

Optimal stopping and dynamic allocation

Published online by Cambridge University Press:  01 July 2016

Fu Chang*
Affiliation:
AT & T Bell Laboratories
Tze Leung Lai*
Affiliation:
Columbia University
*
Postal address: AT & T Bell Laboratories, Crawfords Corner Road, Holmdel, NJ 07733, USA.
∗∗ Postal address: Dept. of Statistics, Box 10 Mathematics, Columbia University, New York, NY 10027, USA.

Abstract

A class of optimal stopping problems for the Wiener process is studied herein, and asymptotic expansions for the optimal stopping boundaries are derived. These results lead to a simple index-type class of asymptotically optimal solutions to the classical discounted multi-armed bandit problem: given a discount factor 0<β <1 and k populations with densities from an exponential family, how should x 1, x 2,… be sampled sequentially from these populations to maximize the expected value of Ʃ 1 βi−1 x i , in ignorance of the parameters of the densities?

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1987 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable