Anscombe-Aumann subjective expected utility model
In decision theory, the Anscombe-Aumann subjective expected utility model (also known as Anscombe-Aumann framework, Anscombe-Aumann approach, or Anscombe-Aumann representation theorem) is a framework to formalizing subjective expected utility (SEU) developed by Frank Anscombe and Robert Aumann.{{cite journal |last1=Anscombe |first1=Frank |last2=Aumann |first2=Robert | author2-link = Robert Aumann| author1-link = Frank Anscombe | title=A Definition of Subjective Probability |journal=Annals of Mathematical Statistics |date=1963 |volume=34 |issue=1 |pages=199–205 |doi=10.1214/aoms/1177704255 |url=https://www.jstor.org/stable/2991295|doi-access=free }}
Anscombe and Aumann's approach can be seen as an extension of Savage's framework to deal with more general acts, leading to a simplification of Savage's representation theorem. It can also be described as a middle-course theory that deals with both objective uncertainty (as in the von Neumann-Morgenstern framework) and subjective uncertainty (as in Savage's framework).{{cite book |last1=Kreps |first1=David | author1-link = David Kreps | title=Notes on the Theory of Choice |date=1988 |publisher=Westview Press |isbn=978-0813375533}}
The Anscombe-Aumann framework builds upon previous work by Savage,{{cite book |last1=Savage |first1=Leonard J. | author1-link = Leonard J. Savage |title=The Foundations of Statistics |date=1954 |publisher=John Wiley & Sons |location=New York}} von Neumann, and Morgenstern{{cite book |last1=von Neumann |first1=John |last2=Morgenstern |first2=Oskar |author1-link=John von Neumann |author2-link=Oskar Morgenstern |title=Theory of Games and Economic Behavior |date=1944 |publisher=Princeton University Press |isbn=978-0691130613}} on the theory of choice under uncertainty and the formalization of SEU. It has since become one of the standard approaches to choice under uncertainty, serving as the basis for alternative models of decision theory such as maxmin expected utility, multiplier preferences and choquet expected utility.{{cite book |last1=Gilboa |first1=Itzhak |author1-link=Itzhak Gilboa |title=Theory of Decision under Uncertainty |date=2009 |publisher=Cambridge University Press |location=New York |isbn=978-0521741231}}
Setup
= Roulette lotteries and horse lotteries =
The Anscombe-Aumann framework is essentially the same as Savage's, dealing with primitives . The only difference is that now the set of acts consists of functions , where is the set of lotteries over outcomes .
This way, Anscombe and Aumann differentiate between the subjective uncertainty over the states (referred to as a horse lottery), and the objective uncertainty given by the acts (referred to as roulette lotteries).
Importantly, such assumption greatly simplifies the proof of an expected utility representation, since it gives the set a linear structure inherited from . In particular, we can define a mixing operation: given any two acts and , we have the act define by
for all .
= Expected utility representation =
As in Savage's model, we want to derive conditions on the primitives such that the preference can be represented by expected-utility maximization. Since acts are now themselves lotteries, however, such representation involves a probability distribution and a utility function which must satisfy
Axioms
Anscombe and Aumann posit the following axioms regarding :
- Axiom 1 (Preference relation) : is complete (for all , it's true that or ) and transitive.
- Axiom 2 (Independence axiom): given , we have that
:
for any and .
- Axiom 3 (Archimedean axiom): for any such that , there exist such that
:
For any act and state , let be the constant act with value .
- Axiom 4 (Monotonicity): given acts , we have
:
- Axiom 5 (Non-triviality): there exist acts such that .
Anscombe-Aumann representation theorem
Theorem: given an environment , the preference relation satisfies Axioms 1-5 if and only if there exist a probability distribution and a non-constant utility function such that
for all acts . Furthermore, is unique and is unique up to positive affine transformations.
See also
Notes
{{reflist|group=nb}}