Mangel M
Zoology Department, University of California, Davis 95616.
Math Biosci. 1990 Jul;100(2):241-8. doi: 10.1016/0025-5564(90)90041-v.
A patch selection game is formulated and analyzed. Organisms can forage in one of H patches. Each patch is characterized by the cost of foraging, the density and value of food, the predation risk, and the density of conspecifics. The presence of conspecifics affects the finding and sharing of food, and the predation risk. Optimal foraging theory can be viewed as a "1-person" game against nature in which the optimal patch choice of a specific organism is analyzed assuming that the number of conspecifics in other patches is fixed. In the general game theoretic approach, the behavior of conspecifics is included in the determination of the distinguished organism's strategy. An iterative algorithm is used to compute the solution of the "n-person" game or dynamic ESS, which differs from the optimal foraging theory solution. Experiments to test the proposed theory using rodents and seed trays are briefly discussed.
构建并分析了一个斑块选择博弈模型。生物可以在H个斑块中的一个觅食。每个斑块的特征包括觅食成本、食物密度和价值、被捕食风险以及同种生物的密度。同种生物的存在会影响食物的发现和共享以及被捕食风险。最优觅食理论可以被视为一种针对自然的“单人”博弈，其中在假设其他斑块中同种生物数量固定的情况下分析特定生物的最优斑块选择。在一般的博弈论方法中，同种生物的行为被纳入到确定该独特生物的策略中。使用迭代算法来计算“多人”博弈或动态进化稳定策略（ESS）的解，这与最优觅食理论的解不同。简要讨论了使用啮齿动物和种子托盘来测试所提出理论的实验。
