PHPE 4000 Individual and Group Decision Making Eric Pacuit - - PowerPoint PPT Presentation

phpe 4000 individual and group decision making
SMART_READER_LITE
LIVE PREVIEW

PHPE 4000 Individual and Group Decision Making Eric Pacuit - - PowerPoint PPT Presentation

PHPE 4000 Individual and Group Decision Making Eric Pacuit University of Maryland pacuit.org 1 / 15 Representing Preferences Let X be a set of options/outcomes. A decision makers preference over X is represented by a relation X X


slide-1
SLIDE 1

PHPE 4000 Individual and Group Decision Making

Eric Pacuit University of Maryland pacuit.org

1 / 15

slide-2
SLIDE 2

Representing Preferences

Let X be a set of options/outcomes. A decision maker’s preference over X is represented by a relation ⊆ X × X.

2 / 15

slide-3
SLIDE 3

Representing Preferences

Given x, y ∈ X, there are four possibilities:

  • 1. x y and y x: The decision maker ranks x above y (the decision maker

strictly prefers x to y).

  • 2. y x and x y: The decision maker ranks y above x (the decision maker

strictly prefers y to x).

  • 3. x y and y x: The agent is indifferent between x and y.
  • 4. x y and y x: The agent cannot compare x and y

3 / 15

slide-4
SLIDE 4

Representing Preferences

Given x, y ∈ X, there are four possibilities:

  • 1. x y and y x: The decision maker ranks x above y (the decision maker

strictly prefers x to y).

  • 2. y x and x y: The decision maker ranks y above x (the decision maker

strictly prefers y to x).

  • 3. x y and y x: The agent is indifferent between x and y.
  • 4. x y and y x: The agent cannot compare x and y

3 / 15

slide-5
SLIDE 5

Representing Preferences

Suppose that is a relation on X (called the weak preference). Then, define the following: ◮ Strict preference: x ≻ y iff x y and y x ◮ Indifference: x ∼ y iff x y and y x ◮ Non-comparability x N y iff x y and y x

4 / 15

slide-6
SLIDE 6

Representing Preferences

Suppose that is a relation on X (called the weak preference). Then, define the following: ◮ Strict preference: x ≻ y iff x y and y x ◮ Indifference: x ∼ y iff x y and y x ◮ Non-comparability x N y iff x y and y x What properties should weak/strict preference, indifference, non-comparability satisfy?

4 / 15

slide-7
SLIDE 7

Assumptions/Axioms of Preference Relations

Hausman (ch. 2) identifies four assumptions or axioms that underlie of conception/use of preference relations (ordinal utility theory).

5 / 15

slide-8
SLIDE 8

Assumptions/Axioms of Preference Relations

Hausman (ch. 2) identifies four assumptions or axioms that underlie of conception/use of preference relations (ordinal utility theory). Two of these are formal constraints on preference relations: ◮ Transitivity ◮ Completeness

5 / 15

slide-9
SLIDE 9

Assumptions/Axioms of Preference Relations

Hausman (ch. 2) identifies four assumptions or axioms that underlie of conception/use of preference relations (ordinal utility theory). Two of these are formal constraints on preference relations: ◮ Transitivity ◮ Completeness The other two are more substantive and often implicit within economic models: ◮ Agents choose in accordance with their preferences (choice determination) ◮ Agents’ preferences do not change over different choice contexts (context independence)

5 / 15

slide-10
SLIDE 10

◮ What is the relationship between choice and preference? ◮ Should a decision maker’s preference be complete and transitive? ◮ Are people’s preferences complete and transitive?

6 / 15

slide-11
SLIDE 11

Preferences and Choices

Preferences are closely related to choices: preferences may cause and to help to explain choices; preferences may be invoked to justify choices, in fortuitous circumstances, we can use preference data to make predictions about choice. But to identify the two would be a mistake.

7 / 15

slide-12
SLIDE 12

Preferences and Choices

◮ We have preferences over vastly more states of affairs than we can ever hope (or dread) to be in the position to choose.

8 / 15

slide-13
SLIDE 13

Preferences and Choices

◮ We have preferences over vastly more states of affairs than we can ever hope (or dread) to be in the position to choose. ◮ What about counter-preferential choice?

8 / 15

slide-14
SLIDE 14

Preferences and Choices

◮ We have preferences over vastly more states of affairs than we can ever hope (or dread) to be in the position to choose. ◮ What about counter-preferential choice? ◮ Preferences must be stable over a reasonable amount of time in a way that (observed) choices aren’t (needed to predict and explain choices).

8 / 15

slide-15
SLIDE 15

Revealed Preference Theory

9 / 15

slide-16
SLIDE 16

Standard economics focuses on revealed preference because economic data comes in this form. Economic data can—at best—reveal what the agent wants (or has chosen) in a particular situation. Such data do not enable the economist to distinguish between what the agent intended to choose and what he ended up choosing; what he chose and what he ought to have chosen. (Gul and Pesendorfer, 2008)

10 / 15

slide-17
SLIDE 17

Given some choices of a decision maker, in what circumtances can we understand those choices as being made by a rational decision maker?

11 / 15

slide-18
SLIDE 18

Sen’s α Condition R: red wine W: white wine L: lemonade

12 / 15

slide-19
SLIDE 19

Sen’s α Condition R: red wine W: white wine L: lemonade

12 / 15

slide-20
SLIDE 20

Sen’s α Condition R: red wine W: white wine L: lemonade

12 / 15

slide-21
SLIDE 21

Sen’s α Condition R: red wine W: white wine L: lemonade

12 / 15

slide-22
SLIDE 22

Sen’s α Condition R: red wine W: white wine L: lemonade R: red wine W: white wine L: lemonade

If the world champion is American, then she must be a US champion too.

12 / 15

slide-23
SLIDE 23

Sen’s α Condition R: red wine W: white wine L: lemonade R: red wine W: white wine L: lemonade

If the world champion is American, then she must be a US champion too.

12 / 15

slide-24
SLIDE 24

Sen’s β Condition R: red wine W: white wine L: lemonade

13 / 15

slide-25
SLIDE 25

Sen’s β Condition R: red wine W: white wine L: lemonade

13 / 15

slide-26
SLIDE 26

Sen’s β Condition R: red wine W: white wine L: lemonade

13 / 15

slide-27
SLIDE 27

Sen’s β Condition R: red wine W: white wine L: lemonade

13 / 15

slide-28
SLIDE 28

Sen’s β Condition R: red wine W: white wine L: lemonade R: red wine W: white wine L: lemonade

If some American is a world champion, then all champions of America must be world champions.

13 / 15

slide-29
SLIDE 29

Revealed Preference Theory

A decision maker’s choices over a set of alternatives X are rationalizable iff there is a (rational) preference relation on X such that the decision maker’s choices maximize the preference relation.

14 / 15

slide-30
SLIDE 30

Revealed Preference Theory

A decision maker’s choices over a set of alternatives X are rationalizable iff there is a (rational) preference relation on X such that the decision maker’s choices maximize the preference relation. Revelation Theorem. A decision maker’s choices satisfy Sen’s α and β if and

  • nly if the decision maker’s choices are rationalizable.

14 / 15

slide-31
SLIDE 31

Choice Functions

Suppose X is a set of options. And consider B ⊆ X as a choice problem. A choice function is any function where C(B) ⊆ B. B is sometimes called a menu and C(B) the set of “rational” or “desired” choices.

15 / 15

slide-32
SLIDE 32

Choice Functions

Suppose X is a set of options. And consider B ⊆ X as a choice problem. A choice function is any function where C(B) ⊆ B. B is sometimes called a menu and C(B) the set of “rational” or “desired” choices. A relation R on X rationalizes a choice function C if for all B C(B) = {x ∈ B | for all y ∈ B xRy}.

15 / 15

slide-33
SLIDE 33

Choice Functions

Suppose X is a set of options. And consider B ⊆ X as a choice problem. A choice function is any function where C(B) ⊆ B. B is sometimes called a menu and C(B) the set of “rational” or “desired” choices. A relation R on X rationalizes a choice function C if for all B C(B) = {x ∈ B | for all y ∈ B xRy}. Sen’s α: If x ∈ C(A) and B ⊆ A and x ∈ B then x ∈ C(B)

15 / 15

slide-34
SLIDE 34

Choice Functions

Suppose X is a set of options. And consider B ⊆ X as a choice problem. A choice function is any function where C(B) ⊆ B. B is sometimes called a menu and C(B) the set of “rational” or “desired” choices. A relation R on X rationalizes a choice function C if for all B C(B) = {x ∈ B | for all y ∈ B xRy}. Sen’s α: If x ∈ C(A) and B ⊆ A and x ∈ B then x ∈ C(B) Sen’s β: If x, y ∈ C(A), A ⊆ B and y ∈ C(B) then x ∈ C(B).

15 / 15