Paul-André Monney, associated professor

• Reasoning under uncertainty, in particular modeling of decision heuristics
• Dempster-Shafer theory of evidence

• Brachinger, H. W., Monney, P.-A. (2003) The Conjunction Fallacy: Explanations of the Linda Problem by the Theory of Hints. International Journal of Intelligent Systems, 18(1), S. 75-79.
• Brachinger, H. W., Monney, P.-A. (2002) Decision Analysis. In: Derigs, U. (Ed.), Optimization and Operations Research, pp 933-978, to appear in the Encyclopedia of Life Support Systems (EOLSS) organized under the auspices of the United Nations Educational, Scientific and Cultural Organization (UNESCO), EOLSS Publishers Co Ltd.
• Anrig, B., Monney, P.-A. (1999) Using Propositional Logic to Compute Probabilities in Multistate Systems. International Journal of Approximate Reasoning, 20, pp. 113-143.
• Anrig, B., Haenni, R., Kohlas, J., Monney, P.-A. (1998) Model-Based Diagnostics and Probabilistic Assumption-Based Reasoning. Artificial Intelligence, 104, pp. 71-106.
• Monney, P.-A. (1997) Support and Plausibility Degrees in Generalized Functional Models. Paper submitted to the Thirteenth Conference on Uncertainty in Artificial Intelligence, Brown University, August 1-3, 1997.
• Bertschy, R., Monney, P.-A. (1996) A Generalization of the Algorithm of Heidtmann to Non-monotone Formulas. Journal of Computational and Applied Mathematics. 76, pp. 55- 76.
• Kohlas, J., Monney, P.-A. (1995) A Mathematical Theory of Hints. An Approach to the Dempster-Shafer Theory of Evidence. Lecture Notes in Economics and Mathematical Systems Series, 425, Springer Verlag. 419 pages.
• Kohlas, J., Monney, P.-A. (1994) Theory of Evidence: A Survey of its Mathematical Foundations, Applications and Computational Aspects. Zeitschrift für Operations Research, 39, pp. 35-68.

Paul-André Monney

teaches since August 2002 at the Purdue University Department of Statistics in West Lafayette, Indiana, USA.