Chapter 5: Choices under Uncertainty Flashcards

1
Q

State-Space Model Representation (general)

A

u(a)=\sum_{s\inS} u_s (a(s))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

State Space Model Constant Utility

A

u(a)=\sum_{s\inS} p(s)U(a(s))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Savage’s Sure Thing Principal

A

Suppose a, a’, b, b’ are four acts and there is T\subseteq S in the state space, where a(s)=a’(s) and b(s)=b’(s) for all s in T. If a(s)=b(s) and a’(s)=b’(s) for all s in T^c.
Then a\succeq b iff a’\succeq b’.
Bringing the problem to another context doesn’t matter. If the action is identical outside the space (T^c), but within the space T there exists a transformation, then that transformation preserves the ordering in that subspace.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

vNM assumptions

A
  1. complete and transitive preferences over outcomes X
  2. Additive separability (mixing in a second lottery instead of the first preserves order)
  3. Continuity (if pi \succ \rho, there is some a for all p s.t. ap + (1-a)pi \succ \rho
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

vNM conclusions

A

iff pi\succeq \rho implies the additive utility representation is greater than or equal to for some U. Any affine transformation of U is also satisfactory.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

AA Setup

A

Define H=Pi^S, and h(s)\in Pi, based on the probability. define mixtures between h and h’ and \alpha h + (1-\alpha)h’ = \alpha h(s)+(1-\alpha)h’(s) for all s. This satisfies mixture space.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

AA Preference Form

A

\sum_{s\in S}\sum_{x\in supp(h(s))} U_s(x) * h(s)(x). Preferences are affine as well.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly