Sparse Probability Assessment Heuristic Based on Orthogonal Matching Pursuit

Published Online:https://doi.org/10.1287/deca.2019.0389

References

  • Abbas AE (2004) Entropy methods for adaptive utility elicitation. IEEE Trans. Systems Man Cybernetics Part A: Systems Humans 34(2):169–178.CrossrefGoogle Scholar
  • Athanassopoulos AD, Podinovski VV (1997) Dominance and potential optimality in multiple criteria decision analysis with imprecise information. J. Oper. Res. Soc. 48(2):142–150.CrossrefGoogle Scholar
  • Bertsimas D, King A, Mazumder R (2014) Statistics and machine learning via a modern optimization lens. Philip Morse Plenary Lecture in INFORMS Conf., San Fransisco.Google Scholar
  • Bickel JE, Smith JE (2006) Optimal sequential exploration: A binary learning model. Decision Anal. 3(1):16–32.LinkGoogle Scholar
  • Candes EJ, Tao T (2005) Decoding by linear programming. IEEE Trans. Inform. Theory 51(12):4203–4215.CrossrefGoogle Scholar
  • Chajewska U, Koller D, Parr R (2000) Making rational decisions using adaptive utility elicitation. Proc. 17th Natl. Conf. Artificial Intelligence (AAAI Press, Menlo Park, CA), 363–369.Google Scholar
  • Clemen RT, Reilly T (1999) Correlations and copulas for decision and risk analysis. Management Sci. 45(2):208–224.LinkGoogle Scholar
  • Davenport MA, Wakin MB (2010) Analysis of orthogonal matching pursuit using the restricted isometry property. IEEE Trans. Inform. Theory 56(9):4395–4401.CrossrefGoogle Scholar
  • Donoho DL, Huo X (1999) Uncertainty principles and ideal atomic decomposition. IEEE Trans. Inform. Theory 47(7):2845–2862.CrossrefGoogle Scholar
  • Donoho DL, Elad M, Temlyakov VN (2006) Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inform. Theory 52(1):6–18.CrossrefGoogle Scholar
  • Fishburn PC, Murphy AH, Isaacs HH (1968) Sensitivity of decisions to probability estimation errors: A reexamination. Oper. Res. 16(2):254–267.LinkGoogle Scholar
  • Freund RM, Orlin JB (1985) On the complexity of four polyhedral set containment problems. Math. Programming 33(2):139–145.CrossrefGoogle Scholar
  • Hannan EL (1981) Obtaining nondominated priority vectors for multiple objective decisionmaking problems with different combinations of cardinal and ordinal information. IEEE Trans. Systems Man Cybernetics Part A: Systems Humans 11(8):538–543.CrossrefGoogle Scholar
  • Hastie T, Tibshirani R, Friedman J (2001) The Elements of Statistical Learning, 2nd ed. (Springer Series in Statistics, Springer New York Inc., New York).CrossrefGoogle Scholar
  • Hazen GB (1986) Partial information, dominance, and potential optimality in multiattribute utility theory. Oper. Res. 34(2):296–310.LinkGoogle Scholar
  • Holloway HA, White CC III (2003) Question selection for multi-attribute decision-aiding. Eur. J. Oper. Res. 148(3):525–533.CrossrefGoogle Scholar
  • Huang T (2015) Efficient sequential probability assessment heuristic in decision analysis. Unpublished doctoral dissertation, The University of Texas, Austin.Google Scholar
  • Kirkwood CW, Sarin RK (1985) Ranking with partial information: A method and an application. Oper. Res. 33(1):38–48.LinkGoogle Scholar
  • Kofler E, Kmietowicz ZW, Pearman AD (1984) Decision making with linear partial information (l. p. i.). J. Oper. Res. Soc. 35(12):1079–1090.CrossrefGoogle Scholar
  • Levi I (1980) The Enterprise of Knowledge (MIT Press, Cambridge, MA).Google Scholar
  • Mangasarian OL, Shiau TH (1986) A variable-complexity norm maximization problem. SIAM J. Algebraic Discrete Methods 7(3):455–461.CrossrefGoogle Scholar
  • Moskowitz H, Preckel PV, Yang A (1993) Decision analysis with incomplete utility and probability information. Oper. Res. 41(5):864–879.LinkGoogle Scholar
  • Natarajan BK (1995) Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2):227–234.CrossrefGoogle Scholar
  • Park KS, Kim SH (1997) Tools for interactive multiattribute decisionmaking with incompletely identified information. Eur. J. Oper. Res. 98(1):111–123.CrossrefGoogle Scholar
  • Tropp JA (2004) Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inform. Theory 50(10):2231–2242.CrossrefGoogle Scholar
  • White CC III, Holloway HA (2008) Resolvability for imprecise multiattribute alternative selection. IEEE Trans. Systems Man Cybernetics Part A: Systems Humans 38(1):162–169.CrossrefGoogle Scholar
  • Yu PL, Zeleny M (1975) The set of all nondominated solutions in linear cases and a multicriteria simplex method. J. Math. Anal. Appl. 49(2):430–468.CrossrefGoogle Scholar
  • Yu PL (1974) Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives. J. Optim. Theory Appl. 14(3):319–377.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.