You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
According to {eq}`eq_old5a`, the ``bliss level`` of real balances is $\frac{u_1}{u_2}$ and the inflation rate that attains it is
228
228
@@ -246,7 +246,7 @@ where $\theta^*$ is given by equation {eq}`eq:Friedmantheta`.
246
246
Milton Friedman assumed that the taxes that government imposes to collect money at rate $\mu_t$ do not distort economic decisions, e.g., they are lump-sum taxes.
247
247
248
248
249
-
## Calvo's Distortion
249
+
## Calvo's distortion
250
250
251
251
The starting point of Calvo {cite}`Calvo1978` and Chang {cite}`chang1998credible`
252
252
is that lump sum taxes are not available.
@@ -352,7 +352,7 @@ A theory of government
352
352
decisions will make $\vec \mu$ endogenous, i.e., a theoretical **output** instead of an **input**.
353
353
354
354
355
-
### Intertemporal Aspects
355
+
### Intertemporal aspects
356
356
357
357
Criterion function {eq}`eq_old7` and the constraint system {eq}`eq_old4` exhibit the following
358
358
structure:
@@ -373,7 +373,7 @@ We'll study outcomes under a Ramsey timing protocol.
373
373
374
374
We'll also study outcomes under other timing protocols.
375
375
376
-
## Three Timing Protocols
376
+
## Three timing protocols
377
377
378
378
We consider three models of government policy making that differ in
379
379
@@ -427,7 +427,7 @@ The relationship between outcomes in the first (Ramsey) timing protocol and th
427
427
```
428
428
429
429
430
-
## Note on Dynamic Programming Squared
430
+
## Note on dynamic programming squared
431
431
432
432
We'll begin with the timing protocol associated with a Ramsey plan and deploy
433
433
an application of what we nickname **dynamic programming squared**.
@@ -443,7 +443,7 @@ Thus, two Bellman equations appear:
443
443
444
444
A value $\theta$ from one Bellman equation appears as an argument of a second Bellman equation for another value $v$.
445
445
446
-
## A Ramsey Planner
446
+
## A Ramsey planner
447
447
448
448
A Ramsey planner chooses
449
449
$\{\mu_t, \theta_t\}_{t=0}^\infty$ to maximize {eq}`eq_old7`
@@ -616,7 +616,7 @@ $$
616
616
\theta_0 = \theta_0^R = - \frac{P_{21}}{P_{22}}
617
617
$$
618
618
619
-
## Representation of Ramsey Plan
619
+
## Representation of Ramsey plan
620
620
621
621
The preceding calculations indicate that we can represent a Ramsey plan
622
622
$\vec \mu$ recursively with the following system created in the spirit of Chang {cite}`chang1998credible`:
@@ -716,7 +716,7 @@ Thus, in our context, time-variation of $\vec \mu$ chosen by a Ramsey planner
716
716
is the telltale sign of the Ramsey plan's **time inconsistency**.
717
717
718
718
719
-
## Constrained-to-Constant-Growth-Rate Ramsey Plan
719
+
## Constrained-to-constant-growth-rate Ramsey plan
720
720
721
721
722
722
We can use brute force to create a government plan that **is** time consistent, i.e., that is a time-invariant function of time.
@@ -759,7 +759,7 @@ Time-variation of $\vec \mu$ chosen by a Ramsey planner
759
759
Obviously, our constrained-to-constant $\mu$
760
760
Ramsey planner **must** must choose a plan that is time consistent.
761
761
762
-
## Markov Perfect Governments
762
+
## Markov perfect governments
763
763
764
764
To generate an alternative model of time-consistent government decision making,
765
765
we assume another timing protocol.
@@ -860,7 +860,7 @@ Under the Markov perfect timing protocol
860
860
* we equate $\mu_t = \mu$ only *after* we have computed a time $t$ government's first-order condition for $\mu_t$.
861
861
862
862
(compute_lq)=
863
-
## Outcomes under Three Timing Protocols
863
+
## Outcomes under three timing protocols
864
864
865
865
We want to compare outcome sequences $\{ \theta_t,\mu_t \}$ under three timing protocols associated with
866
866
@@ -1168,7 +1168,7 @@ In the above graph, notice that $\theta^* < \theta_\infty^R < \theta^{CR} < \the
1168
1168
In some subsequent calculations, we'll use our Python code to study how gaps between
1169
1169
these outcome vary depending on parameters such as the cost parameter $c$ and the discount factor $\beta$.
1170
1170
1171
-
## Ramsey Planner's Value Function
1171
+
## Ramsey planner's value function
1172
1172
1173
1173
The next code plots the Ramsey Planner's value function $J(\theta)$ as well as the value function
1174
1174
of a constrained Ramsey planner who must choose a constant
@@ -1349,7 +1349,7 @@ In the above figure, notice that
1349
1349
1350
1350
1351
1351
1352
-
## Perturbing Model Parameters
1352
+
## Perturbing model parameters
1353
1353
1354
1354
Now let's present some graphs that teach us how outcomes change when we assume different values of $\beta$
1355
1355
@@ -1542,7 +1542,7 @@ in interesting ways.
1542
1542
We leave it to the reader to explore consequences of other constellations of parameter values.
1543
1543
1544
1544
1545
-
### Implausibility of Ramsey Plan
1545
+
### Implausibility of Ramsey plan
1546
1546
1547
1547
Many economists regard a time inconsistent plan as implausible because they question the plausibility of timing protocol in which a plan for setting a sequence of policy variables is chosen once-and-for-all at time $0$.
1548
1548
@@ -1552,7 +1552,7 @@ economists.
1552
1552
1553
1553
* A Markov perfect equilibrium plan is constructed to insure that a sequence of government policymakers who choose sequentially do not want to deviate from it.
1554
1554
1555
-
### Ramsey Plan Strikes Back
1555
+
### Ramsey plan strikes back
1556
1556
1557
1557
Research by Abreu {cite}`Abreu`, Chari and Kehoe {cite}`chari1990sustainable`
1558
1558
{cite}`stokey1989reputation`, and Stokey {cite}`Stokey1991` described conditions under which a Ramsey plan can be rescued from the complaint that it is not credible.
0 commit comments