Psychology and Economics (Lecture 17)

Similar documents
6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation

Optimal Paternalism: Sin Taxes and Health Subsidies

Private Equity Fund Valuation and Systematic Risk

ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE

c 2008 Je rey A. Miron We have described the constraints that a consumer faces, i.e., discussed the budget constraint.

Recursive Algorithms. Recursion. Motivating Example Factorial Recall the factorial function. { 1 if n = 1 n! = n (n 1)! if n > 1

Week 1: Introduction to Online Learning

3. Mathematical Induction

88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a

Competition and Regulation. Lecture 2: Background on imperfect competition

Lecture 3: Growth with Overlapping Generations (Acemoglu 2009, Chapter 9, adapted from Zilibotti)

A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails

Experimental Design. Power and Sample Size Determination. Proportions. Proportions. Confidence Interval for p. The Binomial Test

Practice with Proofs

Linear Programming Notes VII Sensitivity Analysis

Christmas Gift Exchange Games

Continuous Compounding and Discounting

Decision Making under Uncertainty

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2015

A simple analysis of the TV game WHO WANTS TO BE A MILLIONAIRE? R

AN ANALYSIS OF A WAR-LIKE CARD GAME. Introduction

Fixed Point Theorems

Simon Fraser University Spring Econ 302 D200 Final Exam Solution Instructor: Songzi Du Tuesday April 21, 2015, 12 3 PM

Reading 13 : Finite State Automata and Regular Expressions

The Two Envelopes Problem

Web Appendix for Reference-Dependent Consumption Plans by Botond Kőszegi and Matthew Rabin

No Solution Equations Let s look at the following equation: 2 +3=2 +7

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

FNCE 301, Financial Management H Guy Williams, 2006

University of Oslo Department of Economics

A power series about x = a is the series of the form

6. Budget Deficits and Fiscal Policy

Decimal Notations for Fractions Number and Operations Fractions /4.NF

An Innocent Investigation

Solutions for Practice problems on proofs

Game Theory and Algorithms Lecture 10: Extensive Games: Critiques and Extensions

Section 1.5 Exponents, Square Roots, and the Order of Operations

Finance 400 A. Penati - G. Pennacchi. Option Pricing

NPV Versus IRR. W.L. Silber We know that if the cost of capital is 18 percent we reject the project because the NPV

5.1 Radical Notation and Rational Exponents

Understanding Options: Calls and Puts

A Production Planning Problem

BBC LEARNING ENGLISH 6 Minute Grammar Future perfect continuous

Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur

Lecture Notes on MONEY, BANKING, AND FINANCIAL MARKETS. Peter N. Ireland Department of Economics Boston College.

ALMOST COMMON PRIORS 1. INTRODUCTION

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

Capital Structure. Itay Goldstein. Wharton School, University of Pennsylvania

Market Power and Efficiency in Card Payment Systems: A Comment on Rochet and Tirole

Preparation course Msc Business & Econonomics

This means there are two equilibrium solutions 0 and K. dx = rx(1 x). x(1 x) dt = r

The Trip Scheduling Problem

Options Pricing. This is sometimes referred to as the intrinsic value of the option.

LogNormal stock-price models in Exams MFE/3 and C/4

arxiv: v1 [math.pr] 5 Dec 2011

The last three chapters introduced three major proof techniques: direct,

A Few Basics of Probability

Binomial lattice model for stock prices

Notes on Continuous Random Variables

Example 1. Consider the following two portfolios: 2. Buy one c(s(t), 20, τ, r) and sell one c(s(t), 10, τ, r).

Chapter 11 Number Theory

CS 103X: Discrete Structures Homework Assignment 3 Solutions

Difference tests (2): nonparametric

1.7 Graphs of Functions

Chapter 8. Competitive Firms and Markets

LECTURES ON REAL OPTIONS: PART I BASIC CONCEPTS

Sample Size and Power in Clinical Trials

CHAPTER 2 Estimating Probabilities

Lecture Notes on the Mathematics of Finance

Figure 6: Effect of ITC on Skilled and Unskilled Labor Markets

I. Pointwise convergence

14.74 Lecture 12 Inside the household: Is the household an efficient unit?

Lecture 12: The Black-Scholes Model Steven Skiena. skiena

Power Analysis for Correlation & Multiple Regression

Session 7 Fractions and Decimals

Equity Valuation Formulas. William L. Silber and Jessica Wachter

The Golden Rule. Where investment I is equal to the savings rate s times total production Y: So consumption per worker C/L is equal to:

Math Matters: Why Do I Need To Know This? 1 Probability and counting Lottery likelihoods

Math 728 Lesson Plan

Chapter 7 Monopoly, Oligopoly and Strategy

Microeconomic Theory Jamison / Kohlberg / Avery Problem Set 4 Solutions Spring (a) LEFT CENTER RIGHT TOP 8, 5 0, 0 6, 3 BOTTOM 0, 0 7, 6 6, 3

One natural response would be to cite evidence of past mornings, and give something like the following argument:

c. Given your answer in part (b), what do you anticipate will happen in this market in the long-run?

Constrained optimization.

25 Integers: Addition and Subtraction

Math 319 Problem Set #3 Solution 21 February 2002

Two-State Options. John Norstad. January 12, 1999 Updated: November 3, 2011.

Financial Mathematics and Simulation MATH Spring 2011 Homework 2

The vertical differentiation model in the insurance market: costs structure and equilibria analysis

Inflation. Chapter Money Supply and Demand

Lecture 1: Course overview, circuits, and formulas

Language Modeling. Chapter Introduction

CHAPTER 8 CAPITAL BUDGETING DECISIONS

Notes from Week 1: Algorithms for sequential prediction

Odds ratio, Odds ratio test for independence, chi-squared statistic.

Unit 1 Number Sense. In this unit, students will study repeating decimals, percents, fractions, decimals, and proportions.

Introduction to Dynamic Models. Slide set #1 (Ch in IDM).

Transcription:

Psychology and Economics (Lecture 17) Xavier Gabaix April 13, 2004

Vast body of experimental evidence, demonstrates that discount rates are higher in the short-run than in the long-run. Consider a final thought experiment: Choose a ten minute break today or a fifteen minute break tomorrow. Choose a ten minute break in 100 days or a fifteen minute break in 101 days.

Resolution to discount rate evidence: Adopt discount functions that imply high discount rates in the short-run and low discount rates in the long-run. 1 E.g., (τ) = 1+ 1 κτ instead of (τ) = δ τ. If (τ) = 1+κτ, then the instantaneous discount rate will be: d (τ)/dτ = d 1+ 1 κτ /dτ (τ) 1 1+κτ κ(1 + κτ) 2 = (1 + κτ) 1 κ = (1 + κτ) The discount rate declines with τ. Moreover, as τ goes to infinity, the discount rate goes to zero.

0.1 Quasi hyperbolic discount functions: So far, we ve worked with discount functions that are defined in both continuous-time and discrete-time t [0, ) t {0, 1, 2,...}. For example, δ τ and 1+ 1 κτ are defined for all non-negative values of τ. We ll now consider a discount function that is only defined for discrete time.

The quasi hyperbolic discount function (HDF) is: H (τ) = 1 β δ τ We ll sometimes use the easier notation: if τ = 0 if τ {1, 2,...} { H (τ)} τ=0 = {1, βδ, βδ 2, βδ 3,...}. Note that this function looks a little bit like the exponential discount function: E (τ) = δ τ = Here again, it is more natural to write: 1 if τ = 0 δ τ if τ {1, 2,...} { E (τ)} τ=0 = {1, δ, δ 2, δ 3,...}

Let s consider the HDF in greater detail. We ll typically assume that β 1 2 and δ 1 For these values the HDF takes on values 1 1 1 { H (τ)} τ=0 = {1, βδ, βδ 2, βδ 3,...} = {1,,,,...} 2 2 2 Intuition: relative to the current period, all future periods are worth less (weight 1 ). 2 Most (for this example, all) of the discounting takes place between the current period and the immediate future.

There is little (for this example, no) additional discounting between future periods. HDF captures the property that most discounting occurs in the shortrun utils today are twice as valuable as utils tomorrow. In the long-run we re relatively patient utils tomorrow are just as valuable as utils the day after tomorrow.

Thinking about the discount rate in discrete time. We can t differentiate (τ) with respect to τ if this function is only defined at discrete points τ {0, 1, 2,...} So we use differences to approximate derivatives. In continuous-time we define the discount rate at horizon τ as the rate of decline of the discount function d (τ)/dτ (τ)

In discrete-time we define the discount rate at horizon τ as the rate of decline of the discount function (τ) (τ 1) (τ 1)

For the exponential discount function, this discrete-time definition implies that the discount rate is E(τ) E (τ 1) δ τ δ τ 1 = E (τ 1) δ τ 1 = 1 δ ln δ Note that this discrete-time discount rate does not depend on the horizon τ {1, 2, 3,...}.. Note too that this discrete-time discount rate is approximately equal to the discount rate implied by the continuous-time definition.

For HDF, discount rate depends on the horizon. When τ = 1 ρˆ(τ) = H(1) H (0) βδ 1 = H (0) 1 = 1 βδ ( = 1 ) 2 For our example, short-run discount rate is 50%.

When τ {2, 3, 4,...} ρˆ(τ) = H(τ) H (τ 1) βδ τ βδ τ 1 = H (τ 1) βδ τ 1 = 1 δ ln δ ( = 0) For our example, long-run discount rate is 0%.

0.2 Doing a problem set with a commitment technology Consider the decision of when to do a problem set. The cost of doing the problem set increases, the later that you start (say that starting it later makes it more difficult to get help from the TA). You could do the problem set during one of three periods. At date 0, the cost of doing the problem set is 1. At date 1, the cost of doing the problem set is 3 2.

At date 2, the cost of doing the problem set is 5 2. You have a hyperbolic discount function: 2 { (τ)} τ=0 = {1, βδ, βδ 2 }. To simplify matters, set β = 1 2 and δ = 1, so 1 1 { (τ)} 2 τ=0 = {1,, }. 2 2

Assume that the agent has a commitment technology (study group). When would the agent commit to do the problem set? If the problem set is done at period 0, the discounted cost is (0) 1 = 1. If the problem set is done at period 1, the discounted cost is (1) = 3 4. 3 2 If the problem set is done at period 2, the discounted cost is (2) = 5 4. 5 2 So commit to do the problem set at period 1.

0.3 Doing a problem set without commitment. Now suppose that the student does not have access to a commitment technology. Suppose the student is naive about her own behavior, and thinks that whatever plans she makes today will actually be carried out. This is the naive case. So at date 0, she wants to do the problem set at date 1. We proved this on the previous slide. So at date 0, she doesn t do the problem set expecting to do it at date 1.

Assume that period 0 has passed and period 1 has arrived. We ll refer to the self that makes decisions at period 1 as self 1. What does self 1 want to do? If the problem set is done today ( period 1), the discounted cost from the perspective of se lf 1 is (0) =. 3 2 3 2 If the problem set is done tomorrow ( period 2), the discounted cost from the perspective of self 1 is (1) =. 5 2 5 4 So self 1 does NOT want to do the problem set during period 1.

Self 1 prefers to again postpone the problem set another period. Self 1 delays the problem set until period 2, violating the wishes of self 0. Is this procrastination? Self 0 planned to do the problem set in period 1. Self 1, delays the problem set until period 2.

Naives: Naive selfs choose under the (false) assumption that later selves will do what the earlier self wants. In the problem above, the naif equilibrium is to do the problem set in period 2, even though self 0 expects to do the problem set in period 1.

Sophisticates: Sophisticate selfs make decisions based on correct beliefs about the choices of later selves. The sophisticate equilibrium is the same as a subgame perfect Nash equilibrium. Every self has correct beliefs above the play of later selves, and every self optimizes in every subgame.

How would a sophisticate play the game above? Use backwards induction. By assumption, if the problem set is not done in either period 0 or 1, then the problem set will be done in period 2. (It has to get done, since period 2 is the last period in the game.) Now go back to period 1. Self 1 has the choice of doing the problem set in period 1 or leaving the problem set to period 2.

Self 1 prefers to wait. 3 (0) 3 = 2 2 5 (1) 5 = 2 4 So if it s not done before period 1, it won t get done until period 2. Self 0 would like the task to be done in period 1. (0) 1 = 1 3 (1) 3 = 2 4 5 (2) 5 = 2 4 But, self 0 correctly anticipates that self 1 won t do it after all.

So self 0 faces the effective choice of doing it in period 0 or doing it in period 2. Period 0 is preferred (1 < 5 4 ), so self 0 does it in period 0 to avoid delaying it until period 2.

In this problem sophisticates did the problem set too early to avoid doing it too late. However, sometimes even sophisticates can do things too late. Consider the following slightly different cost structure: At date 0, the cost of doing the problem set is 1. At date 1, the cost of doing the problem set is. 5 6 At date 2, the cost of doing the problem set is. 3 2

With commitment, it will be done in period 1. Without commitment, naifs will do it in period 2. Without commitment, sophisticates will do it in period 2!

0.4 What s wrong with these models? 0.4.1 Naives Consider a naif with β = 1 2 and δ = 1. The naif has to finish a project by deadline T. In time period t, the (undiscounted) project costs 3 t 2 utils to execute. When will the naif do the project?

From the current self s perspective, it s always better to postpone doing the project until next period: 3 t > βδ 3 t+1 When will the project be completed? 2 2 1 3 t+1 = 2 2 3 3 t = 4 2

0.4.2 Sophisticates: Consider the same model as above. When will a sophisticate do the project? On the next problem set you will prove the following two claims: 1. If T is even, then sophisticates will do the project in even periods (and not in odd periods). 2. If T is odd, then sophisticates will do the project in odd periods (and not in even periods).