@article{2020appfeletal,
	Year = {2020},
	Author = {E. A. Applegate and G. Feldman and S. R. Hunter and R. Pasupathy},
	Title = {Multi-objective ranking and selection: {O}ptimal sampling laws and tractable approximations via {SCORE}},
	journal = {Journal of Simulation},
	volume = {14},
	number = {1},
	pages = {21--40},
	doi = {10.1080/17477778.2019.1633891},
	url_Paper = {http://web.ics.purdue.edu/~hunter63/PAPERS/pre2019appfeletal.pdf},
	abstract = {Consider the multi-objective ranking and selection (MORS) problem in which we select the Pareto-optimal set from a finite set of systems evaluated on three or more stochastic objectives. Solving this problem is difficult because we must determine how to allocate a simulation budget among the systems to minimize the probability that any systems are misclassified. Toward determining such a simulation budget allocation, we characterize the exact asymptotically optimal sample allocation that maximizes the misclassification-probability decay rate, and we provide an implementable allocation called MO-SCORE. The MO-SCORE allocation has three salient features: (a) it simultaneously controls the probabilities of misclassification by exclusion and inclusion;  (b) it uses a fast dimension-sweep algorithm to identify phantom Pareto systems crucial for computational efficiency; and (c) it models dependence between the objectives. The MO-SCORE allocation is fast and accurate for problems with three objectives or a small number of systems. For problems with four or more objectives and a large number of systems, where modeling dependence has diminishing returns relative to computational speed, we propose independent MO-SCORE (iMO-SCORE). Our numerical experience is extensive and promising: MO-SCORE and iMO-SCORE successfully solve MORS problems involving several thousand systems in three and four objectives.},
	keywords = {simulation optimization > multi-objective > ranking and selection},
	bibbase_note = {<span style="color: green">Recipient of the KD Tocher Medal, 2019-2020, The Operational Research Society.</span>}
	}

{"_id":"qZsF2yRBsn5kvYttr","bibbaseid":"applegate-feldman-hunter-pasupathy-multiobjectiverankingandselectionoptimalsamplinglawsandtractableapproximationsviascore-2020","author_short":["Applegate, E. A.","Feldman, G.","Hunter, S. R.","Pasupathy, R."],"bibdata":{"bibtype":"article","type":"article","year":"2020","author":[{"firstnames":["E.","A."],"propositions":[],"lastnames":["Applegate"],"suffixes":[]},{"firstnames":["G."],"propositions":[],"lastnames":["Feldman"],"suffixes":[]},{"firstnames":["S.","R."],"propositions":[],"lastnames":["Hunter"],"suffixes":[]},{"firstnames":["R."],"propositions":[],"lastnames":["Pasupathy"],"suffixes":[]}],"title":"Multi-objective ranking and selection: Optimal sampling laws and tractable approximations via SCORE","journal":"Journal of Simulation","volume":"14","number":"1","pages":"21–40","doi":"10.1080/17477778.2019.1633891","url_paper":"http://web.ics.purdue.edu/~hunter63/PAPERS/pre2019appfeletal.pdf","abstract":"Consider the multi-objective ranking and selection (MORS) problem in which we select the Pareto-optimal set from a finite set of systems evaluated on three or more stochastic objectives. Solving this problem is difficult because we must determine how to allocate a simulation budget among the systems to minimize the probability that any systems are misclassified. Toward determining such a simulation budget allocation, we characterize the exact asymptotically optimal sample allocation that maximizes the misclassification-probability decay rate, and we provide an implementable allocation called MO-SCORE. The MO-SCORE allocation has three salient features: (a) it simultaneously controls the probabilities of misclassification by exclusion and inclusion; (b) it uses a fast dimension-sweep algorithm to identify phantom Pareto systems crucial for computational efficiency; and (c) it models dependence between the objectives. The MO-SCORE allocation is fast and accurate for problems with three objectives or a small number of systems. For problems with four or more objectives and a large number of systems, where modeling dependence has diminishing returns relative to computational speed, we propose independent MO-SCORE (iMO-SCORE). Our numerical experience is extensive and promising: MO-SCORE and iMO-SCORE successfully solve MORS problems involving several thousand systems in three and four objectives.","keywords":"simulation optimization > multi-objective > ranking and selection","bibbase_note":"<span style=\"color: green\">Recipient of the KD Tocher Medal, 2019-2020, The Operational Research Society.</span>","bibtex":"@article{2020appfeletal,\n\tYear = {2020},\n\tAuthor = {E. A. Applegate and G. Feldman and S. R. Hunter and R. Pasupathy},\n\tTitle = {Multi-objective ranking and selection: {O}ptimal sampling laws and tractable approximations via {SCORE}},\n\tjournal = {Journal of Simulation},\n\tvolume = {14},\n\tnumber = {1},\n\tpages = {21--40},\n\tdoi = {10.1080/17477778.2019.1633891},\n\turl_Paper = {http://web.ics.purdue.edu/~hunter63/PAPERS/pre2019appfeletal.pdf},\n\tabstract = {Consider the multi-objective ranking and selection (MORS) problem in which we select the Pareto-optimal set from a finite set of systems evaluated on three or more stochastic objectives. Solving this problem is difficult because we must determine how to allocate a simulation budget among the systems to minimize the probability that any systems are misclassified. Toward determining such a simulation budget allocation, we characterize the exact asymptotically optimal sample allocation that maximizes the misclassification-probability decay rate, and we provide an implementable allocation called MO-SCORE. The MO-SCORE allocation has three salient features: (a) it simultaneously controls the probabilities of misclassification by exclusion and inclusion; (b) it uses a fast dimension-sweep algorithm to identify phantom Pareto systems crucial for computational efficiency; and (c) it models dependence between the objectives. The MO-SCORE allocation is fast and accurate for problems with three objectives or a small number of systems. For problems with four or more objectives and a large number of systems, where modeling dependence has diminishing returns relative to computational speed, we propose independent MO-SCORE (iMO-SCORE). Our numerical experience is extensive and promising: MO-SCORE and iMO-SCORE successfully solve MORS problems involving several thousand systems in three and four objectives.},\n\tkeywords = {simulation optimization > multi-objective > ranking and selection},\n\tbibbase_note = {<span style=\"color: green\">Recipient of the KD Tocher Medal, 2019-2020, The Operational Research Society.</span>}\n\t} \n\n\n","author_short":["Applegate, E. A.","Feldman, G.","Hunter, S. R.","Pasupathy, R."],"key":"2020appfeletal","id":"2020appfeletal","bibbaseid":"applegate-feldman-hunter-pasupathy-multiobjectiverankingandselectionoptimalsamplinglawsandtractableapproximationsviascore-2020","role":"author","urls":{" paper":"http://web.ics.purdue.edu/~hunter63/PAPERS/pre2019appfeletal.pdf"},"keyword":["simulation optimization > multi-objective > ranking and selection"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://web.ics.purdue.edu/~hunter63/PAPERS/srhunterweb.bib","dataSources":["PkcXzWbdqPvM6bmCx","ZEwmdExPMCtzAbo22"],"keywords":["simulation optimization > multi-objective > ranking and selection"],"search_terms":["multi","objective","ranking","selection","optimal","sampling","laws","tractable","approximations","via","score","applegate","feldman","hunter","pasupathy"],"title":"Multi-objective ranking and selection: Optimal sampling laws and tractable approximations via SCORE","year":2020}