29
Chapter 3 Chapter 3

Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Embed Size (px)

Citation preview

Page 1: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Chapter 3Chapter 3

Page 2: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

* Prerequisite: A binary relation R on X is said to be

Complete if xRy or yRx for any pair of x and y in X;

Reflexive if xRx for any x in X;

Transitive if xRy and yRz imply xRz.

Page 3: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Rational agents and stable prefereRational agents and stable preferences nces

Bundle x is strictly preferred (s.p.), or weakly preferred (w.p.), or indifferent (ind.), to Bundle y.

(If x is w.p. to y and y is w.p. to x, we say x is indifferent to y.)

Page 4: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Assumptions about PreferencesAssumptions about Preferences

Completeness: x is w.p. to y or y is w.p. to x for any pair of x and y.

Reflexivity: x is w.p. to x for any bundle x.

Transitivity: If x is w.p. to y and y is w.p. to z, then x is w.p. to z.

Page 5: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

The indifference sets, the indifference curves.

They cannot cross each other.

Fig.

Page 6: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

indifference curvesindifference curvesx2

x1

Page 7: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Perfect substitutes and perfect complements. Goods, bads, and neutrals. Satiation. Figs

Page 8: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Blue pencils

Red pencils

Indifference curves

Perfect Perfect substitutessubstitutes

Page 9: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Perfect Perfect complementscomplements

Indifference curves

Left shoes

Right shoes

Page 10: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Well-behaved preferences are monotonic (meaning more is better) and

convex (meaning average are preferred to extremes).

Figs

Page 11: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

x2

x1

Betterbundles(x1, x2)

MonotonicityMonotonicity

Betterbundles

Page 12: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

The marginal rate of substitution (MRS) measures the slope of the indifference curve.

MRS = d x2 / d x1, the marginal willingness to pay ( how much to give up of x2 to acquire one more of x1 ).

Usually negative. Fig

Page 13: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Convex indifference curves exhibit a diminishing marginal rate of substitution.

Fig.

Page 14: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

x2

x1

ConvexityConvexity

Averagedbundle

(y1,y2)

(x1,x2)

 

Page 15: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Chapter 4Chapter 4

(as a way to describe preferences)

Page 16: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

UtilitiesUtilities

Essential ordinal utilities,versus

convenient cardinal utility functions.

Page 17: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Cardinal utility functions: u ( x ) ≥ u ( y ) if and only if bundle x is w.p. to bundle y.

The indifference curves are the projections of contours of

u = u ( x1, x2 ).

Fig.

Page 18: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Utility functions are indifferent up to any strictly increasing transformation.

Constructing a utility function in the two-commodity case of well-behaved preferences:

Draw a diagonal line and label each indifference curve with how far it is from the origin.

Page 19: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Examples of utility functionsExamples of utility functions u (x1, x2) = x1 x2 ;

u (x1, x2) = x12 x2

2 ;

u (x1, x2) = ax1 + bx2

(perfect substitutes); u (x1, x2) = min{ax1, bx2}

(perfect complements).

Page 20: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Quasilinear preferences: All indifference curves are vertically (or h

orizontally) shifted copies of a single one, for example u (x1, x2) = v (x1) + x2 .

Page 21: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Cobb-Douglas preferences:

u (x1, x2) = x1c x2

d , or

u (x1, x2) = x1ax2

1-a ;

and their log equivalents:

u (x1, x2) = c ln x + d ln x2 , or

u (x1, x2) = a ln x + (1– a) ln x2

Page 22: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

Cobb-DouglasCobb-Douglas

Page 23: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

MRS along an indifference curve.Derive MRS = – MU1 / MU2

by taking total differential along any indifference curve.

Marginal utilities

MU1 and MU2.

Page 24: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

MarginalMarginal analysis analysis

MM is the slope of the TM curve

AM is the slope of the ray from the origin to the point at the TM curve.

Page 25: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

500490

480 The demand curve

ReservationReservation priceprice

Number of apartment

From peoples’ reservation prices to the market demand curve.

Page 26: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

supply

Demand

PP

Q

EquilibriumEquilibrium

P*P*

Q*

E (P*,Q*)

Page 27: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

supply

Demand

pp

q

E

EquilibriumEquilibrium

Page 28: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

x2

x1

Budget lineBudget set

RationingRationing

R*

Marketopportunity

Page 29: Chapter 3. * Prerequisite: A binary relation R on X is said to be Complete if xRy or yRx for any pair of x and y in X; Reflexive if xRx for any x in X;

MRSMRS

Indifferencecurve

Slope = dx2/dx1

x2

x1

dx2dx1