Intertemporal Substitution and Recursive Smooth Ambiguity ...
Intertemporal Substitution and Recursive Smooth Ambiguity ...
Intertemporal Substitution and Recursive Smooth Ambiguity ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
The axiom below states that the preference {≽ s t} over the subdomain of one-step-aheadacts <strong>and</strong> the preference {≽ 2 s t } over the subdomain of the corresponding second-order actsare consistent with each other.Axiom A7 (Consistency with the Preference over Second-order Acts): For each s t , forevery c ∈ C <strong>and</strong> g +1 , h +1 ∈ G +1 ,3.4. RepresentationNow we state our first representation theorem.(c, g +1 ) ≽ s t (c, h +1 ) ⇐⇒ g 2 +1 ≽ 2 s t h2 +1.Theorem 1 (Representation) The preference process {≽ s t, ≽ 2 s t } satisfies Axioms A1-A7 if<strong>and</strong> only if there exist representation ({V s t}, W, u, v, {µ s t}) such that:(i) On C × G, each ≽ s t is represented by: V s t(c, g) =( ( ∫ ( ∑∫) ))W c, v −1 v ◦ u −1 π(s) u (V s t ,s(c ′ , g ′ )) dg(s)(c ′ , g ′ ) dµ s t(π) , (11)P s ts∈SC×Gfor each (c, g) ∈ C × G, where W : C × R → R is continuous <strong>and</strong> strictly increasing in thesecond argument, u, v : R → R are continuous <strong>and</strong> strictly increasing functions. 15(ii) On C × M, each V s t coincides with:(∫))V (c, m) = W(c, u −1 u (V (c ′ , m ′ )) dm(c ′ , m ′ ) , ∀(c, m) ∈ C × M. (12)C×M(iii) On I (P s t) , each ≽ 2 s t is represented by the function:∫Vs 2 v ◦ u −1 ◦ u (g (π)) dµ s t(π), ∀g ∈ I (P s t) ,P s twhere v ◦ u −1 ◦ u = ψ <strong>and</strong> u : M → R is a mixture linear function:∫u (m) = u (V (c ′ , m ′ )) dm(c ′ , m ′ ), ∀m ∈ M. (13)C×MIn addition, we have the following uniqueness result, up to some monotonic transformations:15 Note that the domains of W , u <strong>and</strong> v may be smaller than those specified in the theorem. We do notmake this explicit in order to avoid introducing additional notations.14