GitHub

@@ -38,7 +38,7 @@ In addition to what's in Anaconda, this lecture will need the following librarie

3838

This lecture describes several linear-quadratic versions of a model that Guillermo Calvo {cite}`Calvo1978` used to illustrate the **time inconsistency** of optimal government

3939

plans.

404041-

Like Chang {cite}`chang1998credible`, we use the models as a laboratory in which to explore consequences of timing protocols for government decision making.

41+

Like Chang {cite}`chang1998credible`, we use these models as laboratories in which to explore consequences of timing protocols for government decision making.

42424343

The models focus attention on intertemporal tradeoffs between

4444

@@ -71,7 +71,11 @@ We specify model fundamentals in ways that allow us to use

7171

linear-quadratic discounted dynamic programming to compute an optimal government

7272

plan under each of our timing protocols.

737374-

In addition to what's in Anaconda, this lecture will need the following libraries:

74+

A sister lecture {doc}`calvo_machine_learn` studies some of the same models but does not use dynamic programming.

75+76+

Instead it uses a **machine learning** approach that does not explicitly recognize the recursive structure structure of the Ramsey problem that Chang {cite}`chang1998credible` saw and that we exploit in this lecture.

77+78+

In addition to what's in Anaconda, this lecture will use the following libraries:

75797680

```{code-cell} ipython3

7781

:tags: [hide-output]

@@ -90,7 +94,7 @@ import pandas as pd

9094

from IPython.display import display, Math

9195

```

929693-

## Model components

97+

## Model Components

94989599

There is no uncertainty.

96100

@@ -224,7 +228,7 @@ $$ (eq_old5a)

224228

The "bliss level" of real balances is $\frac{u_1}{u_2}$ and the inflation rate that attains

225229

it is $-\frac{u_1}{u_2 \alpha}$.

226230227-

## Friedman's optimal rate of deflation

231+

## Friedman's Optimal Rate of Deflation

228232229233

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

230234

@@ -247,9 +251,9 @@ where $\theta^*$ is given by equation {eq}`eq:Friedmantheta`.

247251248252

To deduce this recommendation, Milton Friedman assumed that the taxes that government must impose in order to acquire money at rate $\mu_t$ do not distort economic decisions.

249253250-

- for example, the government imposes lump sum taxes that distort no decisions by private agents

254+

- for example, perhaps the government can impose lump sum taxes that distort no decisions by private agents

251255252-

## Calvo's perturbation of optimal deflation rate

256+

## Calvo's Distortion of Friedman's optimal Deflation Rate

253257254258

The starting point of Calvo {cite}`Calvo1978` and Chang {cite}`chang1998credible`

255259

is that such lump sum taxes are not available.

@@ -353,7 +357,7 @@ A theory of government

353357

decisions will make $\vec \mu$ endogenous, i.e., a theoretical *output* instead of an *input*.

354358355359356-

## Intertemporal structure

360+

## Intertemporal Structure

357361358362

Criterion function {eq}`eq_old7` and the constraint system {eq}`eq_old4` exhibit the following

359363

structure:

@@ -374,7 +378,7 @@ We'll study outcomes under a Ramsey timing protocol.

374378375379

We'll also study outcomes under other timing protocols.

376380377-

## Four timing protocols

381+

## Four Timing Protocols

378382379383

We consider four models of government policy making that differ in

380384

@@ -429,7 +433,7 @@ We'll discuss that topic later in this lecture.

429433430434

We'll begin with the timing protocol associated with a Ramsey plan.

431435432-

## A Ramsey planner

436+

## A Ramsey Planner

433437434438

Here we consider a Ramsey planner that chooses

435439

$\{\mu_t, \theta_t\}_{t=0}^\infty$ to maximize {eq}`eq_old7`

@@ -592,7 +596,7 @@ $$

592596

\theta_0 = \theta_0^R = - \frac{P_{21}}{P_{22}}

593597

$$

594598595-

### Representation of Ramsey plan

599+

## Representation of Ramsey Plan

596600597601

The preceding calculations indicate that we can represent a Ramsey plan

598602

$\vec \mu$ recursively with the following system created in the spirit of Chang {cite}`chang1998credible`:

@@ -660,7 +664,7 @@ Variation of $ \vec \mu^R, \vec \theta^R, \vec v^R $ over time are symptoms o

660664

equation {eq}`eq_old3`.

661665662666663-

### Digression on timeless perspective

667+

## Digression on Timeless Perspective

664668665669

As our subsequent calculations will verify, $ \vec \mu^R, \vec \theta^R, \vec v^R $ are each monotone sequences that are bounded below and converge from above to limiting values.

666670

@@ -698,7 +702,7 @@ that, relative to a Ramsey plan, alter either

698702

- the timing protocol and/or

699703

- assumptions about how government decision makers think their decisions affect the representative agent's beliefs about future government decisions

700704701-

## Constrained-to-constant-growth-rate Ramsey plan

705+

## Constrained-to-Constant-Growth-Rate Ramsey Plan

702706703707

We now describe a model in which we restrict the Ramsey planner's choice set.

704708

@@ -745,7 +749,7 @@ $$ (eq:vcrformula)

745749

government in order eventually to highlight the time-variation of

746750

$\mu_t$ that is a telltale sign of a Ramsey plan's **time inconsistency**.

747751748-

## Markov perfect governments

752+

## Markov Perfect Governments

749753750754

We now describe yet another timing protocol.

751755

@@ -845,7 +849,7 @@ Under the Markov perfect timing protocol

845849

* we equate $\mu_t = \mu$ only *after* we have computed a time $t$ government's first-order condition for $\mu_t$.

846850847851

(compute_lq)=

848-

## Outcomes under three timing protocols

852+

## Outcomes under Three Timing Protocols

849853850854

We want to compare outcome sequences $\{ \theta_t,\mu_t \}$ under three timing protocols associated with

851855

@@ -1148,7 +1152,7 @@ In the above graph, notice that $\theta^* < \theta_\infty^R < \theta^{CR} < \the

11481152

In some subsequent calculations, we'll use our Python code to study how gaps between

11491153

these outcome vary depending on parameters such as the cost parameter $c$ and the discount factor $\beta$.

115011541151-

### Ramsey planner's value function

1155+

### Ramsey Planner's Value Function

1152115611531157

The next code plots the Ramsey Planner's value function $J(\theta)$ as well as the value function

11541158

of a constrained Ramsey planner who must choose a constant

@@ -1493,7 +1497,7 @@ in interesting ways.

1493149714941498

We leave it to the reader to explore consequences of other constellations of parameter values.

149514991496-

### Time inconsistency of Ramsey plan

1500+

### Time Inconsistency of Ramsey Plan

1497150114981502

The variation over time in $\vec \mu$ chosen by the Ramsey planner

14991503

is a symptom of time inconsistency.

@@ -1511,7 +1515,7 @@ is a symptom of time inconsistency.

15111515

A constrained-to-constant-$\mu$ Ramsey plan is time consistent by construction. So is a Markov perfect plan.

15121516

```

151315171514-

### Implausibility of Ramsey plan

1518+

### Implausibility of Ramsey Plan

1515151915161520

In settings in which governments actually choose sequentially, many economists

15171521

regard a time inconsistent plan as implausible because of the incentives to

@@ -1526,7 +1530,7 @@ economists.

1526153015271531

The *no incentive to deviate from the plan* property is what makes the Markov perfect equilibrium concept attractive.

152815321529-

### Ramsey plan strikes back

1533+

### Ramsey Plan Strikes Back

1530153415311535

Research by Abreu {cite}`Abreu`, Chari and Kehoe {cite}`chari1990sustainable`

15321536

{cite}`stokey1989reputation`, and Stokey {cite}`Stokey1991` discovered conditions under which a Ramsey plan can be rescued from the complaint that it is not credible.

@@ -1537,7 +1541,7 @@ it that can serve to deter deviations.

1537154115381542

We turn to such theories of *sustainable plans* next.

153915431540-

## A fourth model of government decision making

1544+

## A Fourth Model of Government Decision Making

1541154515421546

In this model

15431547

@@ -1554,7 +1558,7 @@ In this model

15541558

- at each $t$, the government chooses $\mu_t$ to maximize

15551559

a continuation discounted utility.

155615601557-

### Government decisions

1561+

### Government Decisions

1558156215591563

$\vec \mu$ is chosen by a sequence of government

15601564

decision makers, one for each $t \geq 0$.

@@ -1584,7 +1588,7 @@ for each $t \geq 0$:

15841588

expect an associated $\theta_0^A$ for $t+1$. Here $\vec \mu^A = \{\mu_j^A \}_{j=0}^\infty$ is

15851589

an alternative government plan to be described below.

158615901587-

### Temptation to deviate from plan

1591+

### Temptation to Deviate from Plan

1588159215891593

The government's one-period return function $s(\theta,\mu)$

15901594

described in equation {eq}`eq_old6` above has the property that for all

@@ -1610,7 +1614,7 @@ If the government at $t$ is to resist the temptation to raise its

16101614

current payoff, it is only because it forecasts adverse consequences that

16111615

its setting of $\mu_t$ would bring for continuation government payoffs via alterations in the private sector's expectations.

161216161613-

## Sustainable or credible plan

1617+

## Sustainable or Credible Plan

1614161816151619

We call a plan $\vec \mu$ **sustainable** or **credible** if at

16161620

each $t \geq 0$ the government chooses to confirm private

@@ -1645,7 +1649,7 @@ But Dilip Abreu showed how to render manageable the number of plans that must be

1645164916461650

The key is an object called a **self-enforcing** plan.

164716511648-

### Abreu's self-enforcing plan

1652+

### Abreu's Self-Enforcing Plan

1649165316501654

A plan $\vec \mu^A$ (here the superscipt $A$ is for Abreu) is said to be **self-enforcing** if

16511655

@@ -1710,7 +1714,7 @@ agents' expectation.

17101714

We shall use a construction featured in Abreu ({cite}`Abreu`) to construct a

17111715

self-enforcing plan with low time $0$ value.

171217161713-

### Abreu's carrot-stick plan

1717+

### Abreu's Carrot-Stick Plan

1714171817151719

Abreu ({cite}`Abreu`) invented a way to create a self-enforcing plan with a low

17161720

initial value.

@@ -1745,7 +1749,7 @@ $$

1745174917461750

For an appropriate $T_A$, this plan can be verified to be self-enforcing and therefore credible.

174717511748-

### Example of self-enforcing plan

1752+

### Example of Self-Enforcing Plan

1749175317501754

The following example implements an Abreu stick-and-carrot plan.

17511755

@@ -1861,7 +1865,7 @@ def check_ramsey(clq, T=1000):

18611865

check_ramsey(clq)

18621866

```

186318671864-

### Recursive representation of a sustainable plan

1868+

### Recursive Representation of a Sustainable Plan

1865186918661870

We can represent a sustainable plan recursively by taking the

18671871

continuation value $v_t$ as a state variable.

@@ -1892,7 +1896,7 @@ depends on whether the government at $t$ confirms the representative agent's

18921896

expectations by setting $\mu_t$ equal to the recommended value

18931897

$\hat \mu_t$, or whether it disappoints those expectations.

189418981895-

## Whose plan is it?

1899+

## Whose Plan is It?

1896190018971901

A credible government plan $\vec \mu$ plays multiple roles.

18981902

@@ -1908,7 +1912,7 @@ the action that it wants.

1908191219091913

An argument in favor of the *simply confirm* interpretation is gathered from staring at the key inequality {eq}`eq_old100a` that defines a credible policy.

191019141911-

## Comparison of equilibrium values

1915+

## Comparison of Equilibrium Values

1912191619131917

We have computed plans for

19141918

@@ -1946,7 +1950,7 @@ These include

19461950

- a better plan -- possibly one that attains values associated with

19471951

Ramsey plan -- that is not self-enforcing.

194819521949-

## Note on dynamic programming squared

1953+

## Note on Dynamic Programming Squared

1950195419511955

The theory deployed in this lecture is an application of what we nickname **dynamic programming squared**.

19521956

Read the original on github.com ↗