GitHub

@@ -197,24 +197,22 @@ There are sequences of prices

197197

$\{w_t,\eta_t\}_{t=0}^T= \{\vec{w}, \vec{\eta} \}$

198198

where

199199200-

- $w_t$ is a wage or rental rate for labor at time $t$

200+

- $w_t$ is a wage, i.e., a rental rate, for labor at time $t$

201201202202

- $\eta_t$ is a rental rate for capital at time $t$

203203204204

In addition there is a vector $\{q_t^0\}$ of intertemporal prices where

205205206-

- $q^0_t$ is the price of a good at date $t$ relative

207-

to a good at date $0$.

206+

- $q^0_t$ is the price at time $0$ of one unit of the good at date $t$.

208207209208

We call $\{q^0_t\}_{t=0}^T$ a vector of **Hicks-Arrow prices**,

210209

named after the 1972 economics Nobel prize winners.

211210212211213212214-

But because $q^0_t$ is a **relative price**, the units in terms of

215-

which prices are quoted are arbitrary, we are free to re-normalize them by multiplying all of them by a positive scalar, say $\lambda > 0$.

213+

Because is a **relative price**. the unit of account in terms of which the prices $q^0_t$ are stated is; we are free to re-normalize them by multiplying all of them by a positive scalar, say $\lambda > 0$.

216214217-

Units of $q_t^0$ could be set so that

215+

Units of $q_t^0$ could be set so that they are

218216219217

$$

220218

\frac{\text{number of time 0 goods}}{\text{number of time t goods}}

@@ -369,13 +367,13 @@ $$

369367

or

370368371369

$$

372-

\sum_{t=0}^T q^0_t \left(c_t + (k_{t+1} -(1-\delta)k_t)-(w_t 1 + \eta_t k_t) \right) \leq 0

370+

\sum_{t=0}^T q^0_t \left(c_t + (k_{t+1} -(1-\delta)k_t)\right) \leq \sum_{t=0}^T q^0_t(w_t 1 + \eta_t k_t) \

373371

$$

374372375373

The household faces price system $\{q^0_t, w_t, \eta_t\}$ as a price-taker and chooses an allocation to solve the constrained optimization problem:

376374377375

$$

378-

\begin{aligned}& \max_{\vec{c}, \vec{k} } \sum_{t=0}^T \beta^t u(c_t) \\ \text{subject to} \ \ & \sum_{t=0}^T q_t^0\left(c_t +\left(k_{t+1}-(1-\delta) k_t\right) -w_t -\eta_t k_t\right) \leq 0 \notag \end{aligned}

376+

\begin{aligned}& \max_{\vec{c}, \vec{k} } \sum_{t=0}^T \beta^t u(c_t) \\ \text{subject to} \ \ & \sum_{t=0}^T q_t^0\left(c_t +\left(k_{t+1}-(1-\delta) k_t \right) - (w_t -\eta_t k_t) \right)\leq 0 \notag \end{aligned}

379377

$$

380378381379

Components of a **price system** have the following units:

@@ -384,7 +382,7 @@ Components of a **price system** have the following units:

384382385383

* $\eta_t$ is measured in units of the time $t$ good per unit of time $t$ capital hired

386384387-

* $q_t^0$ is measured in units of the time $t$ good per unit of a numeraire

385+

* $q_t^0$ is measured in units of a numeraire per unit of the time $t$ good

388386389387390388

### Definitions

@@ -428,14 +426,22 @@ price system.

428426

```{note}

429427

This allocation will constitute the **Big** $K$ to be in the present instance of the **Big** $K$ **, little** $k$ trick

430428

that we'll apply to a competitive equilibrium in the spirit of [this lecture](https://python.quantecon.org/rational_expectations.html)

431-

and [this lecture](https://python-advanced.quantecon.org/dyn_stack.html).```

429+

and [this lecture](https://python-advanced.quantecon.org/dyn_stack.html).

430+

```

431+432+

In particular, we shall use the following procedure:

432433433-

In particular, we guess that for $t=0,\dots,T$:

434+

* obtain first-order conditions for the representative firm and the representative consumer.

435+

* from these equations, obtain a new set of equations by replacing the firm's choice variables $\tilde k, \tilde n$ and the consumer's choice variables with the quantities $\vec C, \vec K$ that solve the planning problem.

436+

* solve the resulting equations for $\{\vec{q}, \vec{\eta}, \vec{w}\}$ as functions of $\vec C, \vec K$.

437+

* verify that at these prices, $c_t = C_t, k_t = \tilde k_t = K_t, \tilde n_t = 1$ for $t = 0, 1, \ldots, T$.

438+439+

Thus, we guess that for $t=0,\dots,T$:

434440435441

```{math}

436442

:label: eq-price

437443438-

q_t^0 = \beta^t u'(K_t)

444+

q_t^0 = \beta^t u'(C_t)

439445

```

440446441447

```{math}

@@ -497,7 +503,7 @@ k^*_t = \tilde k^*_t=K_t, \tilde n_t=1, c^*_t=C_t

497503498504

### Verification Procedure

499505500-

Our approach is to stare at first-order necessary conditions for

506+

Our approach is firsts to stare at first-order necessary conditions for

501507

optimization problems of the household and the firm.

502508503509

At the price system we have guessed, we'll then verify that both sets of first-order

@@ -652,12 +658,12 @@ identical to the one that solves the consumer's problem.

652658653659

```{note}

654660

Because budget sets are affected only by relative prices,

655-

$\{q_0^t\}$ is determined only up to multiplication by a

661+

$\{q^0_t\}$ is determined only up to multiplication by a

656662

positive constant.

657663

```

658664659-

**Normalization:** We are free to choose a $\{q_0^t\}$ that

660-

makes $\lambda=1$ so that we are measuring $q_0^t$ in

665+

**Normalization:** We are free to choose a $\{q_t^0\}$ that

666+

makes $\lambda=1$ so that we are measuring $q_t^0$ in

661667

units of the marginal utility of time $0$ goods.

662668663669

We will plot $q, w, \eta$ below to show these equilibrium prices

@@ -816,8 +822,9 @@ k_ss = pp.f_prime_inv(ρ+pp.δ)

816822

c_ss = pp.f(k_ss) - pp.δ * k_ss

817823

```

818824819-

The above code from this lecture {doc}`Cass-Koopmans Planning Model <cass_koopmans_1>` lets us compute an optimal allocation for the planning problem that turns

820-

out to be the allocation associated with a competitive equilibium.

825+

The above code from this lecture {doc}`Cass-Koopmans Planning Model <cass_koopmans_1>` lets us compute an optimal allocation for the planning problem.

826+827+

* from the preceding analysis, we know that it will also be an allocation associated with a competitive equilibium.

821828822829

Now we're ready to bring in Python code that we require to compute additional objects that appear in a competitive equilibrium.

823830

Read the original on github.com ↗