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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

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

The efficiency assumption can now take two forms. Ex post efficiency<br />

requires that, in each state s of the world, the allocation of consumption is<br />

efficient in the usual, static sense: no alternative allocation could improve<br />

both utilities at the same cost. That is, the vector cs = ¡ ca s,cb ¢<br />

s solves:<br />

max u a (c a s) (6.15)<br />

under the constraints:<br />

X<br />

i<br />

u b ¡ c b¢ b<br />

s ≥ ūs ¡ a<br />

pi,s ci,s + c b ¢ a<br />

i,s = ys + y b s = ys<br />

As before, we may denote by μs the Lagrange multiplier of the first constraint;<br />

then the program is equivalent to:<br />

max u a (c a s)+μsu b ¡ c b¢ s<br />

under the resource constraint. The key remark is that, in this program, the<br />

Pareto weight μs of member b may depend on s. Expostefficiency requires<br />

static efficiency in each state, but imposes no restrictions on behavior across<br />

states.<br />

Ex ante efficiency requires, in addition, that the allocation of resources<br />

across states is efficient, in the sense that no state-contingent exchange can<br />

improve both agents’ expected utilities. Note that, now, welfare is computed<br />

ex ante, in expected utility terms. Formally, the vector c =(c1, ..., cS) is<br />

efficient if it solves a program of the type:<br />

max X<br />

πsu a (c a s) (6.16)<br />

s<br />

under the constraints:<br />

X<br />

πsu<br />

s<br />

b ¡ c b¢ s ≥<br />

b<br />

ū (6.17)<br />

X ¡ a<br />

pi,s ci,s + c b ¢<br />

i,s =<br />

a<br />

ys + y b s = ys, s=1,...,S (6.18)<br />

i<br />

Equivalently, if μ denotes the Lagrange multiplier of the first constraint,<br />

the program is equivalent to:<br />

max X<br />

πsu a (c a s)+μ X<br />

πsu b ¡ c b¢ X £ a a<br />

s = πs u (cs)+μu b ¡ c b¢¤ s<br />

s<br />

s<br />

under the resource constraint (6.18).<br />

One can readily see that any solution to this program also solves (6.15) for<br />

μ s = μ. Butex ante efficiency generates an additional constraint - namely,<br />

the Pareto weight μ should be the same across states. A consequence of this<br />

requirement is precisely that risk is shared efficiently between agents.<br />

s

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

Saved successfully!

Ooh no, something went wrong!