Each time period there are two types of agents in the economy: young and old.
There is no population growth and all variables are expressed as per capita. The exogenous endowments follow a stationary, first-order Markov chain. Letst∈S = {s1, . . . , sn}. A young agent has a nonstorable endowmentw1:S→W = [w,w¯], wherew > 0. Old agents have an endowmentw2 : S → W2 = [0,w¯]. Denote w(s) =w1(s) +w2(s)as total endowment in states.
Defineπi,j=prob(st+1 =sj |st=si)fori, j= 1, . . . , n. DefineΠas then× nmatrix of transition probabilities with(i, j)-elementπ(sj|si), where summation across a row equals one. Finally, letˆπ(s)denote the unconditional probability of being in states, equal to the sum of a column of the matrixΠ. LetΠˆ denote the vector of unconditional probabilities. Letst = (s1, . . . , st)be the history of realizations up to timetand letπt(st)denote the probability ofst, wherest∈St=S × · · · × S
t
. Denotectias the periodiconsumption of an agent born in periodt, wherei=t, t+1. The preferences of a young agent born in periodtare
U(ctt) +
st+1
π(st+1|st)V(ctt+1), (1) whereU, V are increasing, strictly concave, and twice continuously differentiable.
Let U1, V1 denote the first derivatives and assume the Inada conditions hold:
limc→0U1(c) =∞andlimc→∞U1(c) = 0forU=U, V. Assumption 1. Leta >0such thatw > a≥0. Asa→0,
−U1(w1(s)−a) +
j
π(sj |s)V1(w2(sj) +a)>0. Denote w¯j = n
i=1ˆπ(si)wj(si) forj = 1,2. The unconditional means of the endowment processes satisfy
U1( ¯w1) =V1( ¯w2). (2) LetV1be convex, so thatV1( ¯w2))<
jπˆjV1(w2(sj)).
This assumption ensures that young agents wish to save in the stochastic environ- ment. The restriction on the unconditional means of the endowment process ensures that the deterministic competitive equilibrium is Pareto optimal in autarky (this is dis- cussed later). The convexity ofV1is assumed so that the assumptions on endowment processes in the deterministic and stochastic environments are consistent.
It is useful at this point to define a function used repeatedly in solving the model.
LetK∈ +be finite and given. Forw≤w≤w¯, letcsolve V1(w−c)
U1(c) =K.
Under the assumptions onU, V, the left side is strictly increasing inc. Asc → 0, U1 → ∞whileV1 → V1(w) >0so the ratio converges to0. Asc → w,U1 → U1(w)whileV1→ ∞; hencecis the unique solution. The inverse function theorem can be applied to define a functionG:W × +→W, such that
c=G(w, K). (3)
The Pareto optimal solution is discussed next and then the competitive equilibrium is constructed.
2.1 Central planning problem
Letφt(st)>0for eachst∈Stdenote the Pareto weight associated with a young agent born at timetin statest, and letφ0(s)be the Pareto weight associated with the initial old at time1 in states. Since I focus on stationary solutions, assume φt(st) =βtφ(st), where0< β ≤1. The resource constraint is
w(s) =ctt+ct−1t . (4) The central planner solves
{c01max,ctt,ctt+1}
s1
φ0(s1)V(c01)
+ ∞ t=1
st∈St
βtφ(st) U(ctt) +
st+1
π(st+1|st)V(ctt+1)
!
+λt(st)[w(st)−ctt−ct−1t ]
, (5)
whereλt(st)is the Lagrange multiplier for the resource constraint (4) at timet.1The first-order conditions with respect to{c10, ctt, ctt+1}are
φ0(s1)V1(c01) =λ1(s1), (6) βtφ(st)U1(ctt) =λt(st), (7) βtφ(st)π(st+1|st)V1(ctt+1) =λt+1(st+1). (8) To find a stationary solution, restrict the decision variables soc : S → + and c2 : S ×S → +, such that ctt = c(st) andctt+1 = c2(st+1, st). With these restrictions on the functionsc, c2, observe that the resource constraint is a function of(st, st−1) only and not the entire history st. Hence define the current-period Lagrange multiplier as
λ(st, st−1)≡β−t
st−2
λt(st).
The first-order conditions are modified as
φ0(s1)V1(c01) =βλ1(s1), (9) φ(st)U1(c(st)) =
st−1
λ(st, st−1), (10) φ(st)π(st+1|st)V1(c2(st+1, st)) =βλ(st+1, st). (11)
1This formulation follows Abel et al. (1989). See the appendix of their paper.
Decrease the time subscript in (11) by one, divide both sides byβ, sum overst−1, equate the right side of (11) to the right side of (10), incorporate (4), and rewrite to obtain
βφ(st)U1(c(st)) =V1(w(st)−c(st))
st−1
φ(st−1)π(st|st−1). (12) This equation corresponds to Equation (3) in Peled (1984) or Equations (4) and (5) in Aiyagari and Peled (1991). Letφ0satisfy
φ0(s) =
kφ(sk)π(si|sk)
β .
Under this assumption, there is a stationary solution.2 Rewrite (12) as
V1(w(s)−c(s))
U1(c(s)) = βφ(s)
st−1φ(st−1)π(s|st−1). (13) The solution to the central planning problem is
c(s;φ) =G w(s), βφ(s)
st−1φ(st−1)π(s|st−1)
!
. (14)
The solution has the property that the consumption of the old is invariant with respect to last period’s aggregate shock.
Given a Pareto vectorφ and the associated solution c(s;φ), define the n× ndiagonal matrixU(c) with(i, i)-th element U1(w1(si)−c(si, φ))along the diagonal and zeroes elsewhere. Next define then×nmatrixV(c)with(i, j)element π(sj |si)V1(w(sj)−c(sj, φ))and denoteVTas its transpose. Define0as ann×1 vector of zeroes and letφ be then×1 vector of Pareto weights. The first-order condition is expressed in matrix notation as
0 = [U(c(φ))−β−1VT(c(φ))]φ, (15) which is a homogeneous system of equations. Given the allocationcand the matrices V,U, the solutionφis not unique. This becomes apparent by dividing each of then equations byφ(si)and solving for then−1values
φ(sj) φ(si)
.
2Observe that my formulation is equivalent to that of Aiyagari and Peled under certain conditions. They have an explicit constraint incorporating the utility of the initial old agents, and they allow the initial old to have a different utility function from agents who are old at later dates. The consumption of the initial old generation constrains the consumption of all subsequent generations and, as they point out, leads to a stationary solution that differs from the steady state. Peled ignores the utility of the initial old generation, thereby focusing on the steady state. By settingβ≤1, and hence discounting the utility of future agents relative to the current generation, and restrictingφ0(s), the economy reaches the stationary solution of Aiyargari and Peled and the steady state solution of Peled, depending on the parameterβ.
The functional dependence of the matrices will be suppressed for convenience in the discussion below. Multiply both sides of (15) by(U)−1(the inverse matrix of U) to obtain
0 = [I−β−1(U)−1VT]φ.
Observe that the matrixM ≡β−1(U)−1VT has all positive elements. The Perron- Frobenius Theorem (see Strang p. 271) can be applied to determine if[I− M]−1 exists.
Letηmdenote the dominant root ofM. Ifηm >1then the inverse fails to be nonnegative, which cannot be a solution since all elements ofφmust be positive. If ηm= 1, then the inverse fails to exist. Ifηm<1then
(I− M)−1=I+M+M2+· · ·
is a convergent sequence. Hence any arbitrary but feasible set of weights may not result in a dominant root less than unity, implying that there is an additional condition that must be satisfied for the allocationcto be Pareto-optimal.
Aiyagari and Peled find a necessary and sufficient condition for a Pareto optimal allocation to exist. They define an×nmatrix
Q≡(U)−1V (16)
and show that an allocationcis Pareto optimal if and only if the matrixQ, which has all positive elements, has a dominant root that is less than or equal to unity. If the dominant root is less than unity, then(I−Q)−1>0and, by the Perron-Frobenius theorem
(I−Q)−1=I+Q+Q2+Q3+· · ·,
which converges to a fixed matrix. LetW be then-dimensional endowment vector withi-th elementw(si). In this case, the expected discounted present value of wealth of the economy
ΠˆT[I+Q+Q2+· · ·]W
is finite. The elements of the matrixQare the contingent claims prices that support the consumption allocation.
Conditional and equal-treatment Pareto-optimal solutions. The Pareto-optimal allocation derived above results in a marginal rate of substitution across agents at a point in time (Eq. 13) that typically varies across statesst. A solution with this property is said to beconditionally Pareto optimal(CPO).
In a static setting, a property of full risk-sharing is a constant marginal rate of substitution across states for all agents. Theequal-treatment Pareto optimal solution (ET-PO) exhibits constant marginal rate of substitution across states, or
V1(w(s)−c(s))
U1(c(s)) =β, . (17)
In this case, the Pareto weights must satisfy φˆ(sj) =
si
π(sj|si) ˆφ(si),
so each Pareto weightφ(st)is proportional to its unconditional probabilityπˆ(st). Observe thatβ= 1is the golden rule allocation.