Lexicographic probability, conditional probability, and nonstandard probability

Simple item page
dc.creatorHalpern, Joseph Y.
dc.date2003-06-17
dc.date2009-04-22
dc.date.accessioned2026-07-07T13:06:57Z
dc.date.available2026-07-07T13:06:57Z
dc.descriptionThe 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.
dc.descriptionA 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
dc.identifierhttps://arxiv.org/abs/cs/0306106
dc.identifierhttp://arxiv.org/abs/cs/0306106
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/227941
dc.subjectComputer Science and Game Theory
dc.subjectArtificial Intelligence
dc.subjectI.2.3
dc.titleLexicographic probability, conditional probability, and nonstandard probability
dc.typetext

Files

Collections

arXiv