Easy and optimal queries to reduce set uncertainty - Archive ouverte HAL Access content directly
Journal Articles European Journal of Operational Research Year : 2017

Easy and optimal queries to reduce set uncertainty


In this paper, we address the problem of optimally querying a single expert to reduce set (interval) uncertainty. We propose optimal querying strategies for two particular query formats (local bound and pair wise comparisons) based on two main selection criteria (the minimax and the Bayesian rules). We study the computational aspects of the optimal solution in the general case and for the specific functions of practical interest (monotonic and multi-linear). The use of the proposed approach is illustrated through numerical simulations on a common estimation problem in reliability analysis.
Fichier principal
Vignette du fichier
Optimal_question.pdf (202.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01702356 , version 1 (21-06-2021)



N. Ben Abdallah, S. Destercke, Mohamed Sallak. Easy and optimal queries to reduce set uncertainty. European Journal of Operational Research, 2017, 256 (2), pp.592-604. ⟨10.1016/j.ejor.2016.06.038⟩. ⟨hal-01702356⟩
117 View
69 Download



Gmail Facebook Twitter LinkedIn More