2003/06/17 by Joseph Y. Halpern, Halpern, Joseph Y. · 2 citations
Computer Science · #Advanced Algebra and Logic #Artificial Intelligence (cs.AI) #Bayesian Modeling and Causal Inference #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #I.2.3 #Rough Sets and Fuzzy Logic #cs.AI #cs.GT
paper · pdf · doi:10.48550/arxiv.cs/0306106
A preliminary version appears in Proceedings of the Eighth Conference on Theoretical Aspects of Rationality and Knowledge, 2001, pp. 17--30. The final version will appear in Games and Economic Behavior
openalex publication_date 2003/06/17 · arxiv created 2009/04/22 · arxiv updated 2009/11/30 · openalex created_date 2022/10/03 · openalex updated_date 2026/07/28
The relationship between Popper spaces (conditional probability spaces that satisfy some regularity conditions), lexicographic probability systems (LPS's), and nonstandard probability spaces (NPS's) is considered. If countable additivity is assumed, Popper spaces and a subclass of LPS's are equivalent; without the assumption of countable additivity, the equivalence no longer holds. If the state space is finite, LPS's are equivalent to NPS's. However, if the state space is infinite, NPS's are shown to be more general than LPS's.