TY - JOUR
T1 - Determinism Versus Uncertainty
T2 - Examining the Worst-Case Expected Performance of Data-Driven Policies
AU - Tian, Xuecheng
AU - Wang, Shuaian
AU - Laporte, Gilbert
AU - Yang, Ying
PY - 2024/10/1
Y1 - 2024/10/1
N2 - This paper explores binary decision making, a critical domain in areas such as finance and supply chain management, where decision makers must often choose between a deterministic-cost option and an uncertain-cost option. Given the limited historical data on the uncertain cost and its unknown probability distribution, this research aims to ascertain how decision makers can optimize their decisions. To this end, we evaluate the worst-case expected performance of all possible data-driven policies, including the sample average approximation policy, across four scenarios differentiated by the extent of knowledge regarding the lower and upper bounds of the first moment of the uncertain cost distribution. Our analysis, using worst-case expected absolute regret and worst-case expected relative regret metrics, consistently shows that no data-driven policy outperforms the straightforward strategy of choosing either a deterministic-cost or uncertain-cost option in these scenarios. Notably, the optimal choice between these two options depends on the specific lower and upper bounds of the first moment. Our research contributes to the literature by revealing the minimal worst-case expected performance of all possible data-driven policies for binary decision-making problems.
AB - This paper explores binary decision making, a critical domain in areas such as finance and supply chain management, where decision makers must often choose between a deterministic-cost option and an uncertain-cost option. Given the limited historical data on the uncertain cost and its unknown probability distribution, this research aims to ascertain how decision makers can optimize their decisions. To this end, we evaluate the worst-case expected performance of all possible data-driven policies, including the sample average approximation policy, across four scenarios differentiated by the extent of knowledge regarding the lower and upper bounds of the first moment of the uncertain cost distribution. Our analysis, using worst-case expected absolute regret and worst-case expected relative regret metrics, consistently shows that no data-driven policy outperforms the straightforward strategy of choosing either a deterministic-cost or uncertain-cost option in these scenarios. Notably, the optimal choice between these two options depends on the specific lower and upper bounds of the first moment. Our research contributes to the literature by revealing the minimal worst-case expected performance of all possible data-driven policies for binary decision-making problems.
KW - Data-driven optimization
KW - Decision analysis
KW - Sample average approximation
KW - Worst-case expected performance
UR - http://www.scopus.com/inward/record.url?scp=85192061186&partnerID=8YFLogxK
U2 - 10.1016/j.ejor.2024.04.031
DO - 10.1016/j.ejor.2024.04.031
M3 - Article
SN - 0377-2217
VL - 318
SP - 242
EP - 252
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 1
ER -