We study the properties of learning rules based on imitation in the context of n-player games played among agents within the same population. We find that there are no (nontrivial) rules that increase (average) expected payoffs at each possible state, and for any possible game. The results highlight the complexity of learning by imitation of successful behavior displayed by conspecifics in the presence of strategic considerations within the same population.