|
ummmm, i gave my best shot to it....and it's weird answer :/
I am getting pareto efficient allocation something like...
for Nth person, (x,y)= (N,y) or (x,0) ... x, y belongs to [0,N]
Now,
~ When this person is having.. (N,y) .. the remaining can have any distribution of good Y.. and allocation will be pareto optimal.
~ when this person is having .. (x,0) ... the (N-1)th person should have .. either (N-x, y) or (x',0)..
~ when he has.. (N-x, y) ... the remaining can have any distribution of good Y
~ when he has.. (x',0) ... the (N-2)th person should have... either (N-x-x') or (x'',0)
...............
and now we continue same way till 1st person...
I am basically trying to say that last person should either have "all X" or "no Y" .... if he has all X... all allocations are optimal.. if he has no Y(and some X).. we move to previous person..
Now he must have "all remaining X" .. or "no Y" .... if 1st case: all allocations b/w remaining people are optimal.... if 2nd case: we move to previous person
Now he must have "all remaining X" .. or "no Y" ... and continues.......
|