Repository | Journal | Volume | Articles
(1988) Synthese 75 (1).
A case is made for supposing that the total probability accounted for in a decision analysis is less than unity. This is done by constructing a measure on the set of all codes for computable functions in such a way that the measure of every effectively accountable subset is bounded by a number β<1. The consistency of these measures with the Savage axioms for rational preference is established. Implications for applied decision theory are outlined.
Publication details
DOI: 10.1007/BF00873273
Full citation:
Madan, D. B. , Owings, J. C. (1988). Decision theory with complex uncertainties. Synthese 75 (1), pp. 25-44.
This document is unfortunately not available for download at the moment.