| Getting more from the data in a multinomial selection problem |
| Full text |
Pdf
(623 KB)
|
| Source
|
Winter Simulation Conference
archive
Proceedings of the 28th conference on Winter simulation
table of contents
Coronado, California, United States
Pages: 287 - 294
Year of Publication: 1996
ISBN:0-7803-3383-7
|
|
Authors
|
|
J. O. Miller
|
Department of Industrial, Welding & Systems Engineering, The Ohio State University, Columbus, OH
|
|
Barry L. Nelson
|
Department of Industrial Engineering & Management Sciences, Northwestern University, Evanston, IL
|
|
Charles H. Reilly
|
Department of Industrial Engineering & Management Systems, University of Central Florida, Orlando, FL
|
|
| Sponsors |
|
| Publisher |
IEEE Computer Society
Washington, DC, USA
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 9, Citation Count: 3
|
|
|
ABSTRACT
We consider the problem of determining which of k simulated systems is most likely to be the best per former based on some objective performance measure. The standard experiment is to generate v in dependent vector observations (replications) across the k- systems. A classical multinomial selection pro cedure, BEM (Bechhofer, Elmaghraby, and Morse), prescribes a minimum number of replications so that the probability of correctly selecting the true best system meets or exceeds a prespecified probability. Assuming that larger is better, BEM selects as best the system having the largest value of the performance measure in more replications than any other. We propose using these same v replications across k systems to form vk pseudoreplications (no longer in dependent) that contain one observation from each system, and again select as best the system having the largest value of the performance measure in more pseudoreplications than any other. We expect that this new procedure, AVC (all vector comparisons), dominates BEM in the sense that AVC will never require more independent replications than DEM to meet a prespecified probability of correct selection. We present analytical and simulation results to show how AVC fares versus BEM for different underly ing distribution families, different numbers of populations and various values of v. We also present results for the closely related problem of estimating the probability that a specific system is the best.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Bechhofer, R. E., S. Elmaghraby, and N. Morse. 1959. A single-sample multiple-decision procedure for selecting the multinomial event which has the highest probability. Annals of Mathematical Statistics 30:102-119.
|
| |
2
|
Bechhofer, R. E., T. Santner, and D. Goldsman. 1995. Design and analysis of experiments for statistical selection, screening and multiple comparisions. New York: John Wiley & Sons, Inc.
|
| |
3
|
Kesten, H., and N. Morse. 1959. A property of the multinomial distribution. Annals of Mathematical Statistics 30:120-127.
|
| |
4
|
P~ndles, R. H., and D. A. Wolfe. 1979. Introduction to the theory of nonparametric statistics. New York: John Wiley.
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|