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.

338 8. Sharing the gains from marriage<br />

Denote the solution for individual utilities (or individual ‘prices’) by<br />

(ûi, ˆvj). From the results on duality (Gale, 1960, chapter 5) we know that<br />

the solution to this problem yields the same value as the solution to the<br />

primal problem. That is<br />

NX<br />

ûi +<br />

i=1 j=1<br />

MX<br />

ˆvj = X<br />

i,j<br />

âijzij,<br />

where â denotes the assignment that solves the primal.<br />

Now compare (8.3) to the dual problem when man N is eliminated:<br />

subject to<br />

min<br />

u,,v<br />

⎛<br />

N−1 X<br />

⎝<br />

i=1<br />

ui +<br />

MX<br />

j=1<br />

ui + vj ≥ zij for i =1, 2...N − 1,j =1, 2...M<br />

vj<br />

⎞<br />

⎠ (8.4)<br />

Denote the solution for prices by (ūi, ¯vj). Again we know that the solution<br />

to this problem yields the same value as the solution to the primal problem.<br />

That is<br />

N−1 X<br />

i=1<br />

ūi +<br />

MX<br />

¯vi = X<br />

j=1<br />

i,j<br />

āijzij.<br />

where ā denotes the assignment that solves the primal associated with (8.4).<br />

Notice that the values (ûi, ˆvj) chosen in the dual problem (8.3) arefeasible<br />

in the dual problem (8.4). It follows that the minimum attained satisfies<br />

or<br />

implying that<br />

N−1 X<br />

i=1<br />

ūi +<br />

MX<br />

¯vj ≤<br />

j=1<br />

N−1 X<br />

i=1<br />

ûi +<br />

MX<br />

ˆvj ,<br />

j=1<br />

X<br />

āijzij ≤ X<br />

âijzij − ûN ,<br />

i,j<br />

i,j<br />

ûN ≤ X<br />

âijzij − X<br />

i,j<br />

i,j<br />

āijzij .<br />

That is, the upper bound on the utility that man N can get is his marginal<br />

contribution to the value of the primal program (that is, the difference<br />

between the maximand with him and without him). Note that to calculate<br />

this upper bound we must know the assignments in both cases, when N is<br />

excluded and N is included. This is easily done if we assume positive or

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

Saved successfully!

Ooh no, something went wrong!