Quantitative macro models feature an infinite number of periods A more realistic (?) view of time

Similar documents
Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.

Project #1 Math 285 Name:

A Principled Approach to. MILP Modeling. Columbia University, August Carnegie Mellon University. Workshop on MIP. John Hooker.

MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008

4. Minimax and planning problems

Piecewise Linear Models

Learning in Games via Opponent Strategy Estimation and Policy Search

Gauss-Jordan Algorithm

It is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = );

M(t)/M/1 Queueing System with Sinusoidal Arrival Rate

CENG 477 Introduction to Computer Graphics. Modeling Transformations

NEWTON S SECOND LAW OF MOTION

1.4 Application Separable Equations and the Logistic Equation

EP2200 Queueing theory and teletraffic systems

Visual Perception as Bayesian Inference. David J Fleet. University of Toronto

Dynamic Route Planning and Obstacle Avoidance Model for Unmanned Aerial Vehicles

Streamline Pathline Eulerian Lagrangian

STEREO PLANE MATCHING TECHNIQUE

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification

Coded Caching with Multiple File Requests

Hyelim Oh. School of Computing, National University of Singapore, 13 Computing Drive, Singapore SINGAPORE

Optimal Crane Scheduling

EECS 487: Interactive Computer Graphics

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)

Scattering at an Interface: Normal Incidence

Reinforcement Learning by Policy Improvement. Making Use of Experiences of The Other Tasks. Hajime Kimura and Shigenobu Kobayashi

A Matching Algorithm for Content-Based Image Retrieval

Engineering Mathematics 2018

Scheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012

ME 406 Assignment #1 Solutions

Discrete Event Systems. Lecture 14: Discrete Control. Continuous System. Discrete Event System. Discrete Control Systems.

The Beer Dock: Three and a Half Implementations of the Beer Distribution Game

Mass-Spring Systems and Resonance

MARSS Reference Sheet

Mobile Robots Mapping

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL

Chapter 3 MEDIA ACCESS CONTROL

Effects needed for Realism. Ray Tracing. Ray Tracing: History. Outline. Foundations of Computer Graphics (Fall 2012)

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures

In fmri a Dual Echo Time EPI Pulse Sequence Can Induce Sources of Error in Dynamic Magnetic Field Maps

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding

7.2 Puiseux Expansions

An Improved Square-Root Nyquist Shaping Filter

SREM: A Novel Multicast Routing Algorithm - Comprehensive Cost Analysis

A Tool for Multi-Hour ATM Network Design considering Mixed Peer-to-Peer and Client-Server based Services

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);

Assignment 2. Due Monday Feb. 12, 10:00pm.

COSC 3213: Computer Networks I Chapter 6 Handout # 7

the marginal product. Using the rule for differentiating a power function,

Precise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves

A non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics

Open Access Research on an Improved Medical Image Enhancement Algorithm Based on P-M Model. Luo Aijing 1 and Yin Jin 2,* u = div( c u ) u

4.1 3D GEOMETRIC TRANSFORMATIONS

Real Time Integral-Based Structural Health Monitoring

Why not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems

Outline. CS38 Introduction to Algorithms 5/8/2014. Network flow. Lecture 12 May 8, 2014

4 Error Control. 4.1 Issues with Reliable Protocols

Axiomatic Foundations and Algorithms for Deciding Semantic Equivalences of SQL Queries

Computer representations of piecewise

An Adaptive Spatial Depth Filter for 3D Rendering IP

Integro-differential splines and quadratic formulae

RECENT advancements in vehicular communication and

Optimal trajectory approximation by cubic splines on fed-batch control problems

Y. Tsiatouhas. VLSI Systems and Computer Architecture Lab

A Formalization of Ray Casting Optimization Techniques

DAGM 2011 Tutorial on Convex Optimization for Computer Vision

Probabilistic Detection and Tracking of Motion Discontinuities

! errors caused by signal attenuation, noise.!! receiver detects presence of errors:!

Design Alternatives for a Thin Lens Spatial Integrator Array

Test - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.

Fill in the following table for the functions shown below.

Autonomic Cognitive-based Data Dissemination in Opportunistic Networks

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets?

MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough

DEFINITION OF THE LAPLACE TRANSFORM

STRING DESCRIPTIONS OF DATA FOR DISPLAY*

Chapter Six Chapter Six

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS

Numerical Solution of ODE

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves

FACIAL ACTION TRACKING USING PARTICLE FILTERS AND ACTIVE APPEARANCE MODELS. Soumya Hamlaoui & Franck Davoine

Simultaneous Localization and Mapping with Stereo Vision

Ray Tracing II. Improving Raytracing Speed. Improving Computational Complexity. Raytracing Computational Complexity

TUTORING TEXTS IN MATHCAD

X-Splines : A Spline Model Designed for the End-User

(Structural Time Series Models for Describing Trend in All India Sunflower Yield Using SAS

Projection & Interaction

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2

Performance Evaluation of Implementing Calls Prioritization with Different Queuing Disciplines in Mobile Wireless Networks

UX260 QUICK START GUIDE

PLCopen for efficiency in automation

Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons

Handling uncertainty in semantic information retrieval process

REDUCTIONS BBM ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM. Bird s-eye view. May. 12, Reduction.

Definition and examples of time series

MIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch

MB86297A Carmine Timing Analysis of the DDR Interface

MOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS

Transcription:

INFINIE-HORIZON CONSUMPION-SAVINGS MODEL SEPEMBER, Inroducion BASICS Quaniaive macro models feaure an infinie number of periods A more realisic (?) view of ime Infinie number of periods A meaphor for many periods A meaphor for alruisic linkages beween generaions Mahemaically convenien because recursive represenaion Limi of a -period economy as One-period subjecive discoun facor β (a scalar in [,]) Wih infiniy of periods, can inerpre as simple way of modeling finie planning horizon Impaience aggregaes geomerically over ime Subjecive discoun for S periods ahead is β S ypically begin analysis from beginning of period zero Index ime wih arbirary indexes, +, +, Sepember,

Inroducion BASICS Recas/resae (some) consumpion heory resuls Recas/resae (some) financial heory resuls New echnical issues Sae-coningen decisions (sill) he key period- consumpion c = H c probabiliy q M c probabiliy p L c probabiliy -p-q corresponding o y = H y probabiliy q y probabiliy p L y probabiliy -p-q Describe as an opimal decision rule c (y ) A mapping from realized income sae o opimal choice in ha sae Infinie-horizon analog c (y ) Bu a more complicaed objec because branching of even ree Sepember, 3 Model Srucure UILIY Preferences v(c, c, c, ) wih all he usual properies Separable across ime Sricly increasing in each c individually Diminishing marginal uiliy in each of c individually Expeced lifeime discouned uiliy E vc (, c, c, c,...) = uc ( ) + βeuc ( ) + β Eu( c ) + β E u( c ) +... 3 3 3 = E β u( c ) = Planning ime aligned wih calendar ime by saring a period zero Condiional on informaion se of period zero Laer consider alernaive formulaions (wihin he class of expeced uiliy and raional expecaions) ime-non-separable uiliy Non-geomeric subjecive discouning Sepember, 4

Model Srucure UILIY Preferences v(c, c, c, ) wih all he usual properies Separable across ime Sricly increasing in each c individually Diminishing marginal uiliy in each of c individually Expeced lifeime discouned uiliy E vc (, c, c, c,...) = uc ( ) + βeuc ( ) + β Eu( c ) + β E u( c ) +... 3 3 3 = E β u( c ) = Planning ime aligned wih calendar ime by saring a period zero Condiional on informaion se of period zero Firs consider deerminisic β uc ( ) and hen consider limi = lim β uc ( ) before urning o sochasic = Sepember, 5 Model Analysis DEERMINISIC SEQUENIAL ANALYSIS Planning horizon max β uc ( ) subjec o { c, a} = = FOCs c a c a c,,, + a = y + ( + r ) a =,... Euler equaions u'( c ) = β u ( c )( + r ) u'( c ) = β u ( c )( + r) c. c a Do we need any condiions a all abou a? u'( c ) = βu ( c )( + r ) Sepember, 6 3

Model Soluion DEERMINISIC SEQUENIAL ANALYSIS Planning horizon max β uc ( ) subjec o { c, a} = = c,,, + a = y + ( + r ) a =,... Need o solve for (+) unknowns c, c, c,, c + unknowns a, a, a,, a + unknowns Need (+) condiions Flow budge consrains for periods,,,, + condiions Euler equaions for periods,,,, - condiions Require one more condiion a (second) boundary condiion Sepember, 7 Macro Fundamenals BOUNDARY CONDIIONS a - provides iniial condiion on problem Requiring second boundary condiion suggess problem is a (sequence of) second-order difference (differenial) equaions Consider Euler equaion for period u'( c) = β u'( c+ )(+ r) Second-order difference equaion in a Need wo boundary condiions o solve Subsiue c and c + using and + budge consrains ( + ( + ) a a ) β ( + ( + ) a a ) u' y r = u y r ( + r) + + Second boundary condiion o require? Candidae a s = consan for s Arbirary Does one arise naurally from he economics of he problem? Sepember, 8 4

Macro Fundamenals BOUNDARY CONDIIONS No-Ponzi game condiion Would be opimal o end wih (infinie) deb Ruling ou sricly negaive asses a end of planning horizon seems naural So le s require a No-Ponzi a no-bankrupcies resricion Presen in mos models (wheher aware of i or no ) (NB Models of defaul do exis bu ofen are opimal defauls ) NO quie he complee second boundary condiion we need Sepember, 9 Macro Fundamenals BOUNDARY CONDIIONS β s λ s measures (presen-discouned) marginal value of resources in period s Saring from allocaion ha solves problem Suppose (c *, c *, c *,, c *; a *, a *, a *, a *) solves problem An inerior allocaion Le V(.) be maximized value (uiliy) * * * * V( a ;.) β u( c ) + λ y + ( + r ) a c a = { } Marginal injecion of resources in period s increases value of objecive funcion by V( a ;.) s = β λs ys Envelope heorem do no need o consider effec of marginal change in y s on opimal choices Suggess a consrucive proof of a second boundary condiion Sepember, 5

Macro Fundamenals CONSRUCING A BOUNDARY CONDIION Define period- objecive funcion ( a ) u ( a, a ) u y+ ( + r ) a Dynamic opimizaion problem β ua { a } = max (, a) = Firs-order necessary condiions u ( a a ), >, u ( a, a ) < u ( a, a ) + βu ( a, a ) =, =,,,..., * * * * + Define maximized value saring from dae ( s s ) * s * * ;.) β u s= V ( a a, a Sepember, Macro Fundamenals CONSRUCING A BOUNDARY CONDIION Assumpions Opimal soluion is inerior (i.e., c > ) (weak assumpion) u (,) (weak assumpion) Implies V () Lifeime uiliy is finie for all feasible pahs Implies * lim β V( a ;.) = Also noe V (.) Is increasing Is concave because u(.) is concave Sepember, 6

Macro Fundamenals CONSRUCING A BOUNDARY CONDIION Envelope condiion * V ( a ;.) * * u * a, a a Firs-order necessary condiions u ( a, a ) + βu ( a, a ) =, =,,,..., * * * * + ( ) V ( a ;.) u ( a ) u a a a a V a ;.) * * * * * * * * * a, a = β (, ) = β ( * β a Recall < By envelope condiion Because V() and V(.) concave Implies > By No-Ponzi condiion, a a end of planning horizon β V ( a ;.) β u ( a, a ) a + * * * * Sepember, 3 Macro Fundamenals CONSRUCING A BOUNDARY CONDIION β V ( a ;.) β u ( a, a ) a + * * * * Consider By No-Ponzi condiion, a a end of planning horizon lim β V ( a ;.) li m β u ( a, a ) a + * * * * = β u (c *)a * + * * * lim β V( a;.) lim β u'( c) a = because lifeime uiliy assumed finie for any feasible pah Sepember, 4 7

Macro Fundamenals BOUNDARY CONDIIONS No-Ponzi game condiion Would be opimal o end wih (infinie) deb Ruling ou sricly negaive asses a end of planning horizon seems naural So le s require a ransversaliy condiion * * lim β u'( c) a = VC he second boundary condiion (along wih iniial condiion) Subopimal o end planning horizon wih posiive asses ha would have sricly raised lifeime discouned uiliy Sufficiency sraighforward o esablish Necessiy much more difficul (Kamihigashi, Economerica) VC is sronger saemen han No-Ponzi condiion Sepember, 5 Model Soluion DEERMINISIC SEQUENIAL ANALYSIS Complee soluion of -period planning horizon? Soluion o consumer problem is a consumpion and asse sequence * * c, a ha saisfies { } = Sequence of flow budge consrains * * * + a + + r a c = y ( ), =,,,... Sequence of Euler equaions u' ( c ) = ( )( ), =,,,... * * β u c+ + r + condiions condiions VC for finie horizon aking as given { } * * * β u'( c) a = a = ( r,,, y a r = ) Exacly as in woperiod model! Sepember, 6 8

Model Soluion DEERMINISIC SEQUENIAL ANALYSIS Complee soluion of infinie-period horizon? Soluion o consumer problem is a consumpion and asse sequence { c * *, a } ha saisfies = Sequence of flow budge consrains * * * + a + + r a c = y (,,, ) =,... Sequence of Euler equaions u'( c ) = ( )( + ), =,,,... * * β u c+ r VC aking as given { } * * lim β u'( c ) a = ( r,,, y a r = ) Sepember, 7 9