IIASA RepositoryAsymptotically Optimal Allocation of Simulation Experiments in Discrete Stochastic OptimizationA.FutschikauthorG.C.PflugauthorApproximate solutions for discrete stochastic optimization problems are often obtained via simulation. It is reasonable to complement these solutions by confidence regions for the argmin-set. We address the question, how a certain total number of random draws should be distributed among the set of alternatives. We propose a one-step allocation rule which turns out to be asymptotically optimal in the case of normal errors for two goals: To minimize the costs caused by using only an approximate solution and to minimize the expected size of the confidence sets.1996-03WP-96-023Monograph

For work being deposited by its own author: In self-archiving this collection of files and associated bibliographic metadata, I grant IIASA Repository the right to store them and to make them permanently available publicly for free on-line. I declare that this material is my own intellectual property and I understand that IIASA Repository does not assume any responsibility if there is any breach of copyright in distributing these files or metadata. (All authors are urged to prominently assert their copyright on the title page of their work.)

For work being deposited by someone other than its author: I hereby declare that the collection of files and associated bibliographic metadata that I am archiving at IIASA Repository) is in the public domain. If this is not the case, I accept full responsibility for any breach of copyright that distributing these files or metadata may entail.

Clicking on the deposit button indicates your agreement to these terms.