Lecture 4 Flashcards

1
Q

Note

A

In decision theory it is preference that is being modelled tf it doesn’t give you an ‘order’ as to what to do

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

Define preference?

A

A term used in relation to choosing between alternatives

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

What is a preference relation?

A

A special type of binary relation (basically a set of ordered pairs)

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

What is strict preference?

A

If x>y

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

What is equivalence/indifference?

A

x~y (ie. x>=y AND y>=x)

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

What is reversed preference?

A

x<=y IF y>=x

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

What is strict reverse preference?

A

xx

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

Suppose V represents >= (ie. it evaluates options in agreement with preference), write this in notation form?

A

[x>=y V(x)>=V(y)]

Tf >= maximises V (dunno why)

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

What is a weak order?

A

A ranking of options that allows ties

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

2 main properties of a weak order?

A

Transitive (if x>=y and y>=z then x>=z)

Complete (for all x,y, x>=y or y>=x)

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

2 other properties of a weak order?

A

Non-triviality - x>y for some x,y

Reflexivity - for all x, x~x

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

See notes

A

Newcomb’s paradox (Wikipedia)

See arguments for taking 1 and 2 boxes also

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

What is the maximin rule?

A

Choosing the act/option whose minimum outcome is the best possible minimum outcome out of all options

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

What is the lethical maximin rule?

A

When there is a tie of best worst outcomes, we move to compare the second worst outcomes and so on and so forth

If all tie then random selection done between tied options

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

See

A

Slides 14-19

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

What is maximax rule?

A

To choose an option whose maximum outcome is the best maximum outcome for all the options

17
Q

What is the optimistic-pessimistic rule?

A

The rule that considers both maximum and minimum outcomes of act/option A, then evaluates it based on own degree of optimism

18
Q

What is the range of the optimism index and what is the equation to calculate the optimistic-pessimistic rule?

A

0<=α<=1 (1 being max optimism)

α.max(A)+(1-α)min(A)

19
Q

What is the minimax regret rule?

A

To choose the option where the maximal regret outcome is the minimum for all the maximal regret outcomes

20
Q

Explain the steps for using the minimax regret rule? (3, and equation, and see table in notes)

A

1) construct regret table
2) identify maximal regret in each act/option
3) identity which act/option’s regret is minimum

Regret = outcome - max outcome in same column