Decision Problems Flashcards

1
Q

3 components of a decision problem.

A
  • ACTIONS
  • OUTCOMES
  • PREFERENCES
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Definition of PREFERENCE.

A

Is a binary relationship on the set of actions A.
Can be WEAK, STRICT, INDIFFERENT.

A preference is said to be:
- COMPLETE if there are not indecisiveness;
- TRANSITIVE if there are no cycles.

If a preference is either complete and transitive then it’s RATIONAL.

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

Definition of UTILITY FUNCTION (also called payoff function).

A

Is an arbitrary quantification u(q) of the goodness coming from some input q.

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

When is a player RATIONAL?

A
  1. They act for their own good;
  2. They are aware of all consequences of their acts.

UPDATED DEFINITON:
A player facing a decision problem with a payoff function u(.) over
outcomes is rational iff he chooses an action a∊A that maximizes his expected payoff.

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

Definition of LOTTERY.

A

Is a set P of probability distributions p: X -> [0, 1] where X is a finite set X = {x1, …, xn} of outcomes.

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

von Neumann–Morgenstern (VNM) utility theorem and axioms.

A

Under certain axioms of rational behavior, a decision-maker faced with risky (probabilistic) outcomes of different choices will behave as if he or she is maximizing the expected value of some function (see the expected utility theory).

Axioms:
1. Preference is complete and transitive;
2. Indipendence
3. Continuity

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

3 types of RISK ATTIDUTE.

A
  • Risk neutral: a player sees A and B as perfect substitute choices;
  • Risk averse: a player prefers a degenerate lottery (the sure thing);
  • Risk loving: reverse.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Backward induction exercize.

A
  1. Classify all nodes with P’s action into groups;
  2. Compute expectations.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly