2007
DOI: 10.1016/j.jebo.2006.06.006
|View full text |Cite
|
Sign up to set email alerts
|

Samaritan versus rotten kid: Another look

Abstract: We set up a two-stage game with sequential moves by one altruist and n selfish agents. The Samaritan's dilemma (rotten kid theorem) states that the altruist can only reach her first best when the selfish agents move after (before) the altruist. 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 affects only his own payoff. The altruist can reach her first best when she moves last if and only if a selfish agent cannot manipulate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

1
19
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 26 publications
(20 citation statements)
references
References 20 publications
1
19
0
Order By: Relevance
“…Our subgame perfect equilibrium under the decentralized leadership thus clearly differs from the Pareto optimum. More generally, for the rotten kid theorem to hold, the prices of the selfish agents' payoffs to the benevolent contributor must be beyond manipulation, as proved by Dijkstra (2007), which is not the case in our paper.…”
Section: Introductionmentioning
confidence: 60%
“…Our subgame perfect equilibrium under the decentralized leadership thus clearly differs from the Pareto optimum. More generally, for the rotten kid theorem to hold, the prices of the selfish agents' payoffs to the benevolent contributor must be beyond manipulation, as proved by Dijkstra (2007), which is not the case in our paper.…”
Section: Introductionmentioning
confidence: 60%
“…Yet, as stated, it raises the question: for what material payoff functions is it satisfied? In a paper about the special case of the rotten kid theorem, Dijkstra (2007, his Lemma 1) answered this question: dp ( a 1 , a 2 ( a 1 )) / da 1 = 0 at SM’s favorite transaction if and only if the material payoff functions are locally conditionally transferable at SM’s favorite transaction, i.e., in a neighborhood of ( a̿ 1 , a̿ 2 ), π1false(a1,a2false)/a2π2false(a1,a2false)/a2=k for some constant k > 0. 16 …”
Section: Necessary Conditions For An Efficient Equilibriummentioning
confidence: 99%
“…Dijkstra’s (2007) result shows that that conjecture was incorrect. Dijkstra’s “Condition 2” characterizes exactly the class of material payoff functions that is locally conditionally transferable at ( a̿ 1 , a̿ 2 ), but the condition is difficult to interpret.…”
mentioning
confidence: 95%
“…This in itself is essentially just a different illustration of the well‐known “Samaritan's dilemma” (see, e.g., Bruce & Waldman, ; Dijkstra, ). Children have an incentive to make themselves poorer in order to increase the subsequent bequest.…”
mentioning
confidence: 99%