Abstract We develop a mathematical model of the performance of a group of independent Bayesian searchers who are all seeking a common goal. In this context, the searchers do not directly interact with one another, but they may observe the behavior of nearby searchers and adjust their behavior accordingly. By modeling this system as an evolutionary game, an evolutionarily stable strategy is found for the percentage of time that a given searcher should bias its performance towards that of others vice when it should follow its own instincts. The dependence of the value of this equilibrium on the group size is determined. Numerical simulation experiments demonstrate the validity of the analytical results. The article concludes with a numerical assessment of the robustness of the stable strategy to a small number of deviating searchers, that is, searchers who adopt an alternative group following strategy.

中文翻译：

---

具有共同目标的独立搜索者的基于游戏的建模

摘要 我们开发了一组寻求共同目标的独立贝叶斯搜索者的表现的数学模型。在这种情况下，搜索者不会直接相互交互，但他们可能会观察附近搜索者的行为并相应地调整他们的行为。通过将此系统建模为进化游戏，在给定搜索者应该遵循自己的直觉时应该将其表现偏向于其他人的行为的时间百分比，可以找到进化稳定的策略。确定该均衡值对组大小的依赖性。数值模拟实验证明了分析结果的有效性。文章最后对稳定策略对少数偏离搜索者的稳健性进行了数值评估，即，