OurBigBook About$ Donate
 Sign in Sign up

Complete lottery preferences (L⪰M or M⪰L)

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Set theory Binary relation Preference relation
2026-10-25  0 By others on same topic  0 Discussions Create my own version
A preference relation on lotteries is complete when every pair is comparable, allowing an indifference relation. Completeness does not require strict ranking of distinct lotteries. Together with a transitive relation, it gives the ordering assumption in the Von Neumann-Morgenstern utility theorem.

 Ancestors (7)

  1. Preference relation
  2. Binary relation
  3. Set theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Past exam of the MSc in advanced computer science course of the University of Oxford / 2021 / Computational game theory / 1 / a / Solution
  • Von Neumann-Morgenstern utility theorem

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook