The Dilemma of the Selfish Herd: The Search for a Realistic Movement Rule
โ Scribed by STEVEN V. VISCIDO; MATTHEW MILLER; DAVID S. WETHEY
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 464 KB
- Volume
- 217
- Category
- Article
- ISSN
- 0022-5193
No coin nor oath required. For personal study only.
โฆ Synopsis
The selfish herd hypothesis predicts that aggregations form because individuals move toward one another to minimize their own predation risk. The "dilemma of the selfish herd" is that movement rules that are easy for individuals to follow, fail to produce true aggregations, while rules that produce aggregations require individual behavior so complex that one may doubt most animals can follow them. If natural selection at the individual level is responsible for herding behavior, a solution to the dilemma must exist. Using computer simulations, we examined four different movement rules. Relative predation risk was different for all four movement rules (p<0.05). We defined three criteria for measuring the quality of a movement rule. A good movement rule should (a) be statistically likely to benefit an individual that follows it, (b) be something we can imagine most animals are capable of following, and (c) result in a centrally compact flock. The local crowded horizon rule, which allowed individuals to take the positions of many flock-mates into account, but decreased the influence of flock-mates with distance, best satisfied these criteria. The local crowded horizon rule was very sensitive to the animal's perceptive ability. Therefore, the animal's ability to detect its neighbors is an important factor in the dynamics of group formation.
๐ SIMILAR VOLUMES
According to the sel"sh herd hypothesis, animals can decrease predation risk by moving toward one another if the predator can appear anywhere and will attack the nearest target. Previous studies have shown that aggregations can form using simple movement rules designed to decrease each animal's Doma
A file of records, each with an associated request probability, is dynamically maintained as a serial list. Successive requests are mutually independent. The list is reordered according to the move-to-front (MTF) rule: The requested record is moved to the front of the list. We derive the stationary