On the Asymptotic Validity of Fully Sequential Selection Procedures for Steady-State Simulation

Abstract

We present fully sequential procedures for steady-state simulation that are designed to select the best of a finite number of simulated systems when “best” is defined by the largest or smallest long-run average performance. We also provide a framework for establishing the asymptotic validity of such procedures and prove the validity of our procedures. An example based on the M/M/1 queue is given.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 135 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.