User:Montgolfière/sandbox/Jeffrey-Bolker axioms

Bolker-Jeffrey theory (or Jeffrey-Bolker theory) is a unified mathematical foundation for Bayesian probability and expected utility theory, put forward by Ethan Bolker and Richard Jeffrey in the late 1960s,[1][2] and popularized in Jeffrey's book The Logic of Decision.[3][note 1] It consists of a set of axioms that constrain the preferences of rational agents, and two theorems which assign subjective probabilities and utilities to any set of propositions, provided only a preference ordering over those propositions.[2] The assignment is only unique up to a fractional linear transformation with positive determinant however, meaning that equally valid Bolker-Jeffrey probability assignments for a given preference ordering may disagree about the relative likelihoods of events.[4]

In the Bolker-Jeffrey formalization, probabilities and utilities are functions of propositions in a complete, atomless Boolean algebra.[5] More specifically, propositions are identified with finite lists of restrictions on the state of the world,[6] where the number of states is required to be uncountably infinite.[7] This is in contrast to the classical Kolmogorov formalization of probability theory, which directly assigns probabilities to (possibly finite) sets of outcomes or states of the world.[8]

Richard Jeffrey espoused this mathematical framework alongside his philosophy of radical probabilism and version of evidential decision theory, but Bolker-Jeffrey theory can be used in combination with other decision theories and epistemologies as well.[9]

Definitions edit

  • The symbol   denotes the impossible proposition, which is assigned probability zero.
  • The supremum, or upper bound, of a set of propositions is a proposition that is implied by every proposition in the set, and which implies every other upper bound on the set.
  • The infimum, or lower bound, of a set of propositions is a proposition that implies by every proposition in the set, and is implied by ever other lower bound of the set.
  • A Boolean algebra is complete if and only if every set of propositions has both a supremum and an infimum.
  • An atom is a proposition   other than   that is implied by itself and  , but by no other proposition.
  • An atomless Boolean algebra is one which contains no atoms in the above sense.[10]

Axioms edit

Axiom 1 (Nonnegativity)
 
Axiom 2 (Normalization)
The probability of a certainly true statement is 1:  
Axiom 3 (Additivity)
Probabilities are additive: if   and   are mutually exclusive then  
Axiom 4 (Desirability Axiom)
 

Existence theorem edit

The existence theorem states that for any transitive preference ordering   over a complete, atomless Boolean algebra less its impossible element  , there is a probability measure   and corresponding signed measure   such that the quotient

 

is a utility function which represents the ordering, in the sense that

 

if and only if the agent prefers   to  .[11] This theorem relies on three axioms:

Averaging condition
If   and   are mutually exclusive then
a) if  , then  , and
b) if  , then  .
Informally, the third axiom asserts that disjunction is an "averaging" operation. The proposition "A or B," where A and B are mutually exclusive, must lie somewhere in between A and B in the preference ranking.[12]
Impartiality
Given that   and   are mutually exclusive and  , if   for some   mutually exclusive with   and  , and not  , then   for every such  .
Continuity
Whenever the supremum (or infimum) of a chain of prospects lies in a preference interval, all members of the chain after (or before) a certain point lie in that interval.

Nonuniqueness edit

The Bolker-Jeffrey system has the counter-intuitive property that the subjective probabilities that it attributes to agents are not unique, and the utility functions that it assigns are unique in a weaker sense than in traditional von Neumann-Morgenstern utility theory. In particular, for any pair  ,   of probability and utility functions representing a preference ordering, a new pair  ,   can be constructed which also represent the ordering, so long as they take the form

 
 ,

for some constants   where

  1. the determinant   is positive,
  2.   is positive for all X in the preference ordering, and
  3.  .[13]

AI researcher Abram Demski dubbed this kind of transformation a "Jeffrey-Bolker rotation."[14]

Noncausality edit

Jeffrey argued that the primary virtue of his formulation of expected utility theory is that it is noncausal. This means that Bolker-Jeffrey theory does not require knowledge of how an agent would revise their preference ranking in the face of counterfactual causal relationships; it only requires that the agent be able to rank logical combinations of propositions already in their preference ordering.[15] This places the theory in contrast to Frank Ramsey and Von Neumann–Morgenstern's theories of expected utility, which make fundamental use of the concept of "gambles" or "lotteries" in which arbitrary events are caused by the outcome of a random process.

To make the argument concrete, Jeffrey uses the following example:

Thus, in Ramsey's theory, if the preference ranking contains the consequences   that "there will be a thermonuclear war next week" and   that "there will be fine weather next week" and if it contains any gambles on the proposition   that "this coin lands head up," then it must also contain the gamble

  if  ,   if not.

It must contain the gamble

There will be a thermonuclear war next week if this coin lands head up, and there will be fine weather next week if not.

However, for the agent to consider that this gamble might be in effect would require him so radically to revise his view of the causes of war and weather as to make nonsense of whatever judgment he might offer; and we are no more able than the agent, to say how he would rank such a gamble among the other propositions in his field of preference.

I take it to be the prinicipal virtue of the present theory, that it makes no use of the notion of a gamble or of any other causal notion.

— The Logic of Decision, (1983), page 157 [emphasis added, reformatted for brevity]

In essence, Jeffrey holds that it is unreasonable to require that rational agents have preferences about gambles which they believe to be causally impossible. Further, he argues that even when an agent does have preferences about impossible gambles, these preferences are not a suitable basis for making inferences about their beliefs, since the supposition that an impossible gamble is possible will necessarily change the agent's other beliefs in important ways.[16]

Extensions edit

In a 1999 article, James Joyce extended the Bolker-Jeffrey system by positing a primitive confidence ranking  , such that for any two propositions   and  ,   if and only if   is believed to be more likely than  . He proves that under weak assumptions, if   satisfies Bruno de Finetti's axioms of comparative probability and Villegas' continuity condition,[17] then there is a pair of probability and utility functions   and   representing the agent's confidence and preference rankings such that   is unique and   is unique up to a positive linear transformation.[18] Joyce argues that his extension to the theory corrects one of its most serious defects— its inability to uniquely specify the strength of probabilities and utilities.[19]

Notes edit

  1. ^ The first edition of The Logic of Decision was published in 1965, before Bolker's representation theorem was published. The second edition, published in 1983, added a chapter on Bolker's axioms.

References edit

  1. ^ Bolker 1966.
  2. ^ a b Bolker 1967.
  3. ^ Jeffrey 1983.
  4. ^ Briggs 2019, "Notice that fractional linear transformations of a probability-utility pair can disagree with the original pair about which propositions are likelier than which others".
  5. ^ Briggs 2019, "Bolker's theorem assumes a single domain of propositions, which are objects of preference, utility, and probability alike".
  6. ^ Bolker 1967, p. 335: "We cannot really question our subject about a state of the universe because specifying one requires too much information. "Swimming tomorrow" is a set of states, not a state, for there are infinitely many ways in which it can come about. In some the subject swims alone, in others with company. The water temperature can vary. We should think of s as the event consisting of those states in which he swims. It might be reasonable, then, to use for S not the algebra of all subsets of M but the algebra of those subsets which are described by a finite list of restrictions on the members they contain".
  7. ^ Bolker 1967, pp. 335-337: "We must have algebras which are both atom free and complete. The classical example of such an algebra is the algebra of measurable subsets of the unit interval... we can interpret the completeness condition as forcing us to pass from a discrete infinity of states to a continuum, just as repudiating atoms forced us to abandon a finite state space".
  8. ^ Hájek 2019, "1. Kolmogorov’s Probability Calculus".
  9. ^ Joyce 2000, S3: "Although Jeffrey does not do things this way, it is useful to think of this theory as being divided into three distinct components: a formal axiology, or theory of rational preference, that tells us which preference rankings are rational, but does so without placing any constraints on confidence rankings; an epistemology, or theory of rational belief; that tells us which confidence rankings are rational without placing any constraints on the agent's preferences; and a theory of coherence, that tells us which preference rankings and confidence rankings can be rationally held together".
  10. ^ Jeffrey 1983, p. 148.
  11. ^ Bolker 1966, p. 336.
  12. ^ Jeffrey 1983, p. 146.
  13. ^ Jeffrey 1983, p. 97.
  14. ^ Demski 2018.
  15. ^ Jeffrey 1983, p. 157.
  16. ^ Maher 1987, p. 166.
  17. ^ Villegas 1964.
  18. ^ Briggs 2019, "Joyce (1999) shows that with additional resources, Bolker's theorem can be modified to pin down a unique P, and a U that is unique up to positive linear transformation. We need only supplement the preference ordering with a primitive “more likely than” relation, governed by its own set of axioms, and linked to belief by several additional axioms. Joyce modifies Bolker's result to show that given these additional axioms, the “more likely than” relation is represented by a unique P, and the preference ordering is represented by P together with a utility function that is unique up to positive linear transformation".
  19. ^ Joyce 2000, S1, S9: "Current opinion has it that there are two flaws in Jeffrey's theory. First, there is the non-uniqueness problem. In contrast with other decision theories, it is not possible within Jeffrey's framework to secure expected utility representations for preferences that are unique up to the choice of a unit and a zero for measuring utility (except in special circumstances)... Result 2 shows that the non-uniqueness inherent in Jeffrey's theory of preference can be removed by imposing constraints directly on confidence rankings. Non-uniqueness is thus not an intrinsic feature of preferences in Jeffrey's theory; rather, it is a consequence of trying to make a theory of rational preference do something that only can be accomplished when such a theory is combined with an epistemology".

Works cited edit

  • Bolker, Ethan D. (1966). "Functions resembling quotients of measures" (PDF). Transactions of the American Mathematical Society. 124 (2): 292–312. Retrieved 2 March 2022.
  • Bolker, Ethan D. (1967). "A Simultaneous Axiomatization of Utility and Subjective Probability" (PDF). Philosophy of Science. 34 (4): 333–340. Retrieved 2 March 2022.
  • Briggs, Rachael (2019). "Normative Theories of Rational Choice: Expected Utility". The Stanford Encyclopedia of Philosophy. Stanford University. Retrieved 2 March 2022.
  • Demski, Abram. "Probability is Real, and Value is Complex". LessWrong.
  • Hájek, Alan (2019). "Interpretations of Probability". The Stanford Encyclopedia of Philosophy. Stanford University. Retrieved 2 March 2022.
  • Jeffrey, Richard (1983). "9. Existence: Bolker's Axioms". The Logic of Decision (2nd ed.). University of Chicago Press. ISBN 978-0226395821.
  • Joyce, James M. (2000). "Why we still need the logic of decision" (PDF). Philosophy of science. 67: S1–S13. Retrieved 2 March 2022.
  • Maher, Patrick (1987). "Causality in the logic of decision" (PDF). Theory and Decision. 22 (2): 155–172.
  • Villegas, Carlos (1964). "On Qualitative  -algebras" (PDF). The Annals of Mathematical Statistics. 35 (4): 1787-1796. Retrieved 5 April 2022.