Question: Agent A solves: max x_{1A} + x_{2A} s.t p x_{1A} + x_{2A} = 2p + 1 and agent B solves max (1+epsilon)x_{1B} + x_{2B} s.t
Agent A solves: \max x_{1A} + x_{2A} s.t p x_{1A} + x_{2A} = 2p + 1 and agent B solves \max (1+\epsilon)x_{1B} + x_{2B} s.t p x_{1B} + x_{2B} = p+ 2 with \epsilon > 0 and small. Show that the bundle ((0,3), (3,0)) is not Pareto optimal
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
