Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/106813
DC Field | Value | Language |
---|---|---|
dc.contributor | Faculty of Business | - |
dc.creator | Tian, X | - |
dc.creator | Wang, S | - |
dc.creator | Laporte, G | - |
dc.creator | Yang, Y | - |
dc.date.accessioned | 2024-06-04T07:39:55Z | - |
dc.date.available | 2024-06-04T07:39:55Z | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | http://hdl.handle.net/10397/106813 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier BV | en_US |
dc.subject | Data-driven optimization | en_US |
dc.subject | Decision analysis | en_US |
dc.subject | Sample average approximation | en_US |
dc.subject | Worst-case expected performance | en_US |
dc.title | Determinism versus uncertainty : examining the worst-case expected performance of data-driven policies | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1016/j.ejor.2024.04.031 | - |
dcterms.abstract | 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. | - |
dcterms.accessRights | embargoed access | en_US |
dcterms.bibliographicCitation | European journal of operational research, Available online 27 April 2024, In Press, Corrected Proof, https://doi.org/10.1016/j.ejor.2024.04.031 | - |
dcterms.isPartOf | European journal of operational research | - |
dcterms.issued | 2024 | - |
dc.identifier.scopus | 2-s2.0-85192061186 | - |
dc.identifier.eissn | 1872-6860 | - |
dc.description.validate | 202406 bcch | - |
dc.identifier.FolderNumber | a2751 | en_US |
dc.identifier.SubFormID | 48229 | en_US |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | National Natural Science Foundation of China | en_US |
dc.description.pubStatus | Early release | en_US |
dc.date.embargo | 0000-00-00 (to be updated) | en_US |
dc.description.oaCategory | Green (AAM) | en_US |
Appears in Collections: | Journal/Magazine Article |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.