17.01.2013 Views

Pierre André Chiappori (Columbia) "Family Economics" - Cemmap

Pierre André Chiappori (Columbia) "Family Economics" - Cemmap

Pierre André Chiappori (Columbia) "Family Economics" - Cemmap

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

252 6. Uncertainty and Dynamics in the Collective model<br />

that would improve both agents’ welfare in expected utility terms -which<br />

is exactly the meaning of programs (6.8) and (6.9).<br />

Finally, note that the intertemporal version of the problem obtains simply<br />

by replacing the state of the world index s by a time index t and the<br />

probability πs of state s with a discount factor - say, δ t .<br />

6.2.2 Constraints on commitment<br />

Limits to commitment can generally be translated into additional constraints<br />

in the previous programs. To take a simple example, assume that<br />

in each state of the world, one member - say b - has some alternative option<br />

that he cannot commit not to use. Technically, in each state s, there<br />

is some lower bound ū b s for b’s utility; here, ū b s is simply the utility that<br />

b would derive from his fallback option. This constraint obviously reduces<br />

the couple’s ability to share risk. Indeed, it may well be the case that, in<br />

some states, efficient risk sharing would require b’swelfaretogobelowthis<br />

limit. However, a contract involving such a low utility level in some states<br />

is not implementable, because it would require from b more commitment<br />

than what is actually available.<br />

The technical translation of these ideas is straightforward. Introducing<br />

the new constraint into program (6.8) gives:<br />

max<br />

Qs,q a s ,qb s<br />

X<br />

s<br />

πsu a ¡ Qs, q a s, q b¢ s<br />

subject to P 0 sQs+p 0 ¡ a<br />

s qs + q b¢ ¡ a<br />

s ≤ ys + y b s<br />

X<br />

πsu b ¡ Qs, q a s, q b¢ b<br />

s ≥ ū<br />

s<br />

¢ for all s, (6.10)<br />

and u b ¡ Qs, q a s, q b¢ b<br />

s ≥ ūs for all s (6.11)<br />

Let μs denote the Lagrange multiplier of constraint (Cs); the program<br />

can be rewritten as:<br />

X<br />

πsu a ¡ Qs, q a s, q b¢ X<br />

s + (μπs + μs) u b ¡ Qs, q a s, q b¢ s<br />

max<br />

Qs,q a s ,qb s<br />

or equivalently:<br />

max<br />

Qs,q a s ,qb s<br />

s<br />

subject to P 0 sQs+p 0 ¡ a<br />

s qs + q b¢ ¡ a<br />

s ≤ ys + y b¢ s for all s<br />

X<br />

s<br />

πs<br />

s<br />

∙<br />

u a ¡ Qs, q a s, q b µ<br />

¢<br />

s + μ + μ <br />

s<br />

u<br />

πs<br />

b ¡ Qs, q a s, q b¢ s<br />

¸<br />

¡ a<br />

qs + q b¢ ¡ a<br />

s ≤ ys + y b¢ s for all s<br />

(6.12)<br />

subject to P 0 sQs+p 0 s<br />

Here, ex post efficiency still obtains: in each state s, the household maximizes<br />

the weighted sum ua ³<br />

+ μ + μ ´<br />

s u πs<br />

b . However, the weight is no longer

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!