Countable Additivity and the Foundations of Bayesian Statistics |
| |
Authors: | John V Howard |
| |
Institution: | (1) Departments of Operational Research and Statistics, London School of Economics, Houghton Street, London, WC2A 2AE, UK |
| |
Abstract: | At a very fundamental level an individual (or a computer) can process only a finite amount of information in a finite time.
We can therefore model the possibilities facing such an observer by a tree with only finitely many arcs leaving each node.
There is a natural field of events associated with this tree, and we show that any finitely additive probability measure on
this field will also be countably additive. Hence when considering the foundations of Bayesian statistics we may as well assume
countable additivity over a σ-field of events. |
| |
Keywords: | Bayesian statistics foundations countable additivity finite additivity |
本文献已被 SpringerLink 等数据库收录! |
|