Abstract
I show that Dempster's Rule of combination can be represented in the theory of Markov chains and use this representation to derive limit theorems concerning the long term effect of updating belief with Dempster's rule.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Dempster, A. P.: 1967, ‘Upper and Lower Probabilities Induced by a Multivalued Mapping’, Ann. Math. Stat. 38, 325–339.
Dubois, D. and Prade, H.: 1982, ‘On Several Representations of an Uncertain Body of Evidence’, pp. 167–181 in Gupta, M. M. and Sanchez, E. (eds.), Fuzzy Information and Decision Processes, North Holland.
Feller, W.: 1968, An Introduction to Probability Theory and Its Applications, Wiley.
Freedman, D.: 1971, Markov Chains, Holden-Day.
Goodman, I. R.: 1982, ‘Fuzzy Sets as Equivalence Classes of Random Sets’, pp. 327–42 in R. R. Yager (ed.), Fuzzy Sets and Possibility Theory: Recent Developments, Oxford.
Goodman, I. R. and Nguyen, H. T.: 1985, Uncertainty Models for Knowledge-Based Systems, North-Holland.
Kemeny, J. G. and Snell, J. L.: 1960, Finite Markov Chains, Van Nostrand.
Kolmogorov, A. N.: 1950, Foundations of the Theory of Probability, Chelsea, New York.
Nguyen, H. T.: 1978, ‘On Random Sets and Belief Functions’, Journal of Mathematical Analysis and Applications 65, 531–542.
Shafer, G.: 1976, A Mathematical Theory of Evidence, Princeton Univ. Press, Princeton.
Shafer, G.: 1979, ‘Allocations of Probability’, Annals of Probability 7, 827–39.