UTILITY-BASED STATISTICAL SELECTION PROCEDURES

被引:0
作者
Sun, Guowei [1 ]
Li, Yunchuan [2 ]
Fu, Michael C. [3 ]
机构
[1] Univ Maryland, Inst Syst Res, Dept Math, College Pk, MD 20742 USA
[2] Univ Maryland, Inst Syst Res, Dept Elect & Comp Engn, College Pk, MD 20742 USA
[3] Univ Maryland, Inst Syst Res, Robert H Smith Business Sch, College Pk, MD 20742 USA
来源
2019 WINTER SIMULATION CONFERENCE (WSC) | 2019年
基金
美国国家科学基金会;
关键词
BUDGET ALLOCATION; PROSPECT-THEORY; OPTIMIZATION;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present two sequential allocation frameworks for selecting from a set of competing alternatives when the decision maker cares about more than just the simple expected rewards. The frameworks are built on general parametric reward distributions and assume the objective of selection, which we refer to as utility, can be expressed as a function of the governing reward distributional parameters. The first algorithm, which we call utility-based OCBA (UOCBA), uses the.-technique to find the asymptotic distribution of a utility estimator to establish the asymptotically optimal allocation by solving the corresponding constrained optimization problem. The second, which we refer to as utility-based value of information (UVoI) approach, is a variation of the Bayesian value of information (VoI) techniques for efficient learning of the utility. We establish the asymptotic optimality of both allocation policies and illustrate the performance of the two algorithms through numerical experiments.
引用
收藏
页码:3416 / 3427
页数:12
相关论文
共 20 条
[1]  
[Anonymous], 2006, Simulation modeling and analysis
[2]  
[Anonymous], P 2005 WINT SIM C
[3]  
Berger R. L., 2002, STAT INFERENCE, V2
[4]  
Chen C. h., 2011, Stochastic simulation optimization: An optimal computing budget allocation, V1
[5]   Simulation budget allocation for further enhancing the efficiency of ordinal optimization [J].
Chen, CH ;
Lin, JW ;
Yücesan, E ;
Chick, SE .
DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2000, 10 (03) :251-270
[6]  
Chick SE, 2006, HBK OPERAT RES MANAG, V13, P225, DOI 10.1016/S0927-0507(06)13009-1
[7]   Sequential Sampling to Myopically Maximize the Expected Value of Information [J].
Chick, Stephen E. ;
Branke, Juergen ;
Schmidt, Christian .
INFORMS JOURNAL ON COMPUTING, 2010, 22 (01) :71-80
[8]   The Knowledge-Gradient Policy for Correlated Normal Beliefs [J].
Frazier, Peter ;
Powell, Warren ;
Dayanik, Savas .
INFORMS JOURNAL ON COMPUTING, 2009, 21 (04) :599-613
[9]   Stochastic Optimization in a Cumulative Prospect Theory Framework [J].
Jie, Cheng ;
Prashanth, L. A. ;
Fu, Michael ;
Marcus, Steve ;
Szepesvari, Csaba .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2018, 63 (09) :2867-2882
[10]   Efficient global optimization of expensive black-box functions [J].
Jones, DR ;
Schonlau, M ;
Welch, WJ .
JOURNAL OF GLOBAL OPTIMIZATION, 1998, 13 (04) :455-492