Sequential sampling to myopically maximize the expected value of information
Chick, S. E., Branke, Jürgen, 1969- and Schmidt, C.. (2010) Sequential sampling to myopically maximize the expected value of information. INFORMS Journal on Computing, 22 (1). pp. 71-80. ISSN 1091-9856Full text not available from this repository.
Official URL: http://dx.doi.org/10.1287/ijoc.1090.0327
Statistical selection procedures are used to select the best of a finite set of alternatives, where “best” is defined in terms of each alternative's unknown expected value, and the expected values are inferred through statistical sampling. One effective approach, which is based on a Bayesian probability model for the unknown mean performance of each alternative, allocates samples based on maximizing an approximation to the expected value of information (EVI) from those samples. The approximations include asymptotic and probabilistic approximations. This paper derives sampling allocations that avoid most of those approximations to the EVI but entails sequential myopic sampling from a single alternative per stage of sampling. We demonstrate empirically that the benefits of reducing the number of approximations in the previous algorithms are typically outweighed by the deleterious effects of a sequential one-step myopic allocation when more than a few dozen samples are allocated. Theory clarifies the derivation of selection procedures that are based on the EVI.
|Item Type:||Journal Article|
|Subjects:||H Social Sciences > HA Statistics|
|Divisions:||Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences
Faculty of Social Sciences > Warwick Business School
|Journal or Publication Title:||INFORMS Journal on Computing|
|Publisher:||Institute for Operations Research and the Management Sciences (I N F O R M S)|
|Official Date:||November 2010|
|Page Range:||pp. 71-80|
|Access rights to Published version:||Restricted or Subscription Access|
Actions (login required)
Downloads per month over past year