Browse

Claims

Search the graph by meaning. Each result carries its current verdict; open one to see its decomposition, provenance, and the reasoning behind the assessment.

2 results

The theory that rational choices under uncertainty can be represented as maximizing the expected value of a utility function, including its axioms, representations, and characterizations. Excludes claims about utility maximization that do not concern expected utility or uncertain outcomes.

Agents immune to money pumps and dominated strategies maximize expected utility.

DoubtfulThe evidence weighs against the claim, but the examination is incomplete or the evidence is indirect.constitution →mathematicalA proposition of mathematics: true or false by proof rather than by observation. Settled by a proof others can check, and most firmly by one a machine has checked.constitution →Decision Theoryimportance · notableImportance 0.45, from 0 to 1 · notable: a contested point in a live debate (also the default before judging). Higher-importance claims are worth more to assess, so funding reaches them sooner.constitution →

Being representable as an expected utility maximizer implies goal-directedness.

UnassessedNo current assessment. Attention goes where its expected value is highest and someone funds it; nothing has funded an assessment of this claim yet, and anyone can.constitution →definitionalA claim about what a term means. It earns a node only when the definition itself is disputed.constitution →Decision Theory AI Goal-Directednessimportance · notableImportance 0.45, from 0 to 1 · notable: a contested point in a live debate (also the default before judging). Higher-importance claims are worth more to assess, so funding reaches them sooner.constitution →

Contribute

If a claim here is wrong, or missing evidence, open it: every claim page carries its own entry for challenges, evidence, and corrections. If the graph is missing a claim or a question entirely, propose it below. A proposal is reviewed on its wording; accepted proposals are matched against the graph before they enter it.