Abstract
Given a coherent conditional prevision we obtain, by means of the Yosida-Hewitt Decomposition Theorem, an upper bound of its failures of conglomerability with respect to a random number and a denumerable partition. In this way we get an extension of Theorem 2.3 of [4] to coherent previsions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Rivista di Matematica per le Scienze Economiche e Sociali
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.