Samaritan vs rotten kid: Another look
We set up a two-stage game with sequential moves by one altruistic agent and n selfish agents. The rotten kid theorem states that the altruist can only reach her first best when the selfish agents move before the altruist. The Samaritan's dilemma, on the other hand, states that the altruist can only reach her first best when she moves before the selfish agents. We find that in general, the altruist can reach her first best when she moves first, if and only if a selfish agent's action marginally only affects his own payoff. The altruist can reach her first best when she moves last if and only if there is just one commodity involved. When the altruist cannot reach her first best when she moves last, the outcome is not Pareto efficient either.
|Date of creation:||29 Aug 2002|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +44 1334 462479
Web page: http://www.res.org.uk/society/annualconf.asp
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ecj:ac2002:63. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum)
If references are entirely missing, you can add them using this form.