On lexicographic probability relations

DOI10.1016/0165-4896(86)90026-0MaRDI QIDQ1072417zbMATH OpenOpenAlexFDO

Authors Uzi Segal

Publication date 1986

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0165-4896(86)90026-0

zbMATH Keywords

lexicographic probabiity relationtight probability relations

Mathematics Subject Classification ID

Individual preferences (91B08)

Review text

The paper examines conditions under which a probability relation on a set of events is lexicographic. A probability relation is called lexicographic if there is an event A such that events are ordered lexicographically by their intervections with A and not A. The main result of the paper is that for tight probability relations, if in one of the maximal chains of events with probability zero there exists a maximal event (containing all the events of this chain), then the probability relation is lexicographic.

Recommendations

• Lexicographic probability, conditional probability, and nonstandard probability
• Lexicographic choice functions without archimedeanicity
• Lexicographic probabilities and robustness
• A space of lexicographic preferences
• Lexicographic Probabilities and Choice Under Uncertainty

Cites work

• scientific article; zbMATH DE number 3434895 (Why is no real title available?)
• scientific article; zbMATH DE number 3190627 (Why is no real title available?)
• scientific article; zbMATH DE number 3092991 (Why is no real title available?)
• Subgroups of Free Products with Amalgamated Subgroups: A Topological Approach

Cited in

(2)

• Counterexamples to Segal's measure representation theorem
• Lexicographic probability, conditional probability, and nonstandard probability

This page was built for publication: On lexicographic probability relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072417)