• Non ci sono risultati.

MACROECONOMICS 2016 Problem set n° 2 Prof. Nicola Dimitri

N/A
N/A
Protected

Academic year: 2021

Condividi "MACROECONOMICS 2016 Problem set n° 2 Prof. Nicola Dimitri"

Copied!
1
0
0

Testo completo

(1)

MACROECONOMICS 2016

Problem set n° 2 Prof. Nicola Dimitri

1) Consider the OLG with money seen in class, where the two periods endowments of the consumption good for the representative agent are 𝑒1 > 0 and 𝑒2> 0, with the population growing according to the following equation 𝑁𝑡 = (1 + 𝑛)𝑡𝑁0

Suppose the good is perishable, that is the storage technology is characterized by a return rate 𝑟 = −1.

a) Write down the budget constraints, for the two periods, and the inter-temporal budget constraint.

b) Discuss the dynamic stability of monetary stationary state, that is the stability of the real- money market equilibrium equation 𝑚𝑡+1= ℎ(𝑚𝑡), when the utility function of the representative agent 𝑊(𝑐1𝑡, 𝑐2𝑡+1) is

i) 𝑐1𝑡+𝑙𝑜𝑔𝑐1+𝜃2𝑡+1 ii) 𝑐1𝑡+1+𝜃𝑐2𝑡

2) Consider the OLG without money seen in class, where the two periods endowments of the consumption good for the representative agent are 𝑒1= 0 and 𝑒2= 0. Population grows as in problem 1. Suppose the utility function of the representative agent 𝑊(𝑐1𝑡, 𝑐2𝑡+1) = 𝑙𝑜𝑔𝑐1𝑡+𝑐1+𝜃2𝑡+1 and the production function 𝑓(𝑘𝑡) = 𝑘𝑡𝑎, with 0 < 𝑎 < 1. Find the dynamic law driving the evolution of the equilibrium per capita capital 𝑘𝑡, discuss its stationary states and its dynamics

3)

A) Consider the following one variable 𝑥𝑡 ≥ 0 , discrete time, dynamical system

𝑥𝑡= 𝑎𝑥𝑡−1(𝑏 − 𝑥𝑡−1) + 𝑐(𝑏 − 𝑥𝑡−1) (𝐺𝑒𝑛𝑒𝑟𝑎𝑙𝑖𝑠𝑒𝑑 𝑙𝑜𝑔𝑖𝑠𝑡𝑖𝑐 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛) 𝑤𝑖𝑡ℎ 𝑎, 𝑏, 𝑐 > 0

Draw a graph of the function, find the Stationary States and discuss their stability. Can the system ever exhibit cyclical dynamics?

4) Consider the two variable, first order linear difference equation, system

𝑥𝑡= 2𝑥𝑡−1+ 𝑦𝑡−1+ 5 𝑦𝑡 = 0.3𝑦𝑡−1+ 1

Find the stationary state of the system and discuss whether or not is a saddle point.

Riferimenti

Documenti correlati

[External memory implicit searching] Given a static input array A of N keys in EM, describe how to organize the keys inside A by suitably permuting them during a prepro- cessing

Show that the problem cannot be solved deterministically under the following rules: the algorithm can access only O(log c n) information for each of the k items that it can store,

– Select a set of edges in one parent to copy to the child – Copy as many edges as possible from the other parent – Add random edges to fill any remaining

Romer “Advanced Macroeconomics” (McGraw Hill) 2012 Further readings will be indicated during the course Office Hours (March-May 2016). Wednesday 18-20;

La classe potrà essere divisa in due gruppi: in questo caso, il primo gruppo sosterrà il test dalle 9 alle 10.15 mentre il secondo dalle 10.30 alle 11.45.. Se vi sarà divisione

 Tuttavia se la seconda parte non è superata, o rifiutata, la valutazione sulla prima parte sarà perduta e lo studente dovrà sostenere l’intero esame.  Chi rifiuta il voto non

[r]

Problem set n° 2 Prof. a) Write down the budget constraints, for the two periods, and the inter-temporal budget