Game-based modeling of independent searchers who share a common goal

Thomas A. Wettergren

Applied Mathematics and Computation, 2021, vol. 391, issue C

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.

Keywords: Evolutionary game; Bayesian search; Equilibrium; Group behavior; Modeling (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320305750
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:391:y:2021:i:c:s0096300320305750

DOI: 10.1016/j.amc.2020.125621

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().