Sparse Probability Assessment Heuristic Based on Orthogonal Matching Pursuit

Tao Huang () and J. Eric Bickel ()
Additional contact information
Tao Huang: Operations Research & Industrial Engineering, The University of Texas at Austin, Austin, Texas 78712
J. Eric Bickel: Operations Research & Industrial Engineering, The University of Texas at Austin, Austin, Texas 78712

Decision Analysis, 2019, vol. 16, issue 4, 281-300

Abstract: Probability assessment via expert elicitation or statistical analysis is a critical step in the decision-analysis process. In many actual applications, the number of uncertainties and the corresponding number of assessments can be quite large. In these cases, the analyst may seek guidance in focusing the assessment on the most important uncertainties. In this paper, we develop a novel heuristic that we call the sparse probability assessment heuristic (SPAH). SPAH, which is based on a well-known method in machine learning known as orthogonal matching pursuit, seeks to identify the preferred alternative while conducting the fewest number of assessments. We test SPAH under a variety of conditions and compare its performance to standard practice. In so doing, we show that SPAH is able to identify the optimal alternative while requiring substantially fewer assessments than standard practice.

Keywords: probability assessment; partial information; orthogonal matching pursuit (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1287/deca.2019.0389 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ordeca:v:16:y:2019:i:4:p:281-300

Access Statistics for this article

More articles in Decision Analysis from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().