IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v391y2021ics0096300320305750.html
   My bibliography  Save this article

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

Author

Listed:
  • Wettergren, Thomas A.

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.

Suggested Citation

  • Wettergren, Thomas A., 2021. "Game-based modeling of independent searchers who share a common goal," Applied Mathematics and Computation, Elsevier, vol. 391(C).
    • Handle: RePEc:eee:apmaco:v:391:y:2021:i:c:s0096300320305750
    DOI: 10.1016/j.amc.2020.125621
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320305750
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125621?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ferdinandy, B. & Bhattacharya, K. & Ábel, D. & Vicsek, T., 2012. "Landing together: How flocks arrive at a coherent action in time and space in the presence of perturbations," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(4), pages 1207-1215.
    2. Thomas A. Wettergren & John G. Baylog, 2014. "Discrete search allocation with object uncertainty," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 20(1), pages 1-20.
    3. Lidbetter, Thomas, 2013. "Search games with multiple hidden objects," LSE Research Online Documents on Economics 55103, London School of Economics and Political Science, LSE Library.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wettergren, Thomas A., 2021. "Replicator dynamics of an N-player snowdrift game with delayed payoffs," Applied Mathematics and Computation, Elsevier, vol. 404(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Robbert Fokkink & Ken Kikuta & David Ramsey, 2017. "The search value of a set," Annals of Operations Research, Springer, vol. 256(1), pages 63-73, September.
    2. Steve Alpern & Thomas Lidbetter, 2019. "Approximate solutions for expanding search games on general networks," Annals of Operations Research, Springer, vol. 275(2), pages 259-279, April.
    3. Yolmeh, Abdolmajid & Baykal-Gürsoy, Melike, 2021. "Weighted network search games with multiple hidden objects and multiple search teams," European Journal of Operational Research, Elsevier, vol. 289(1), pages 338-349.
    4. Robbert Fokkink & Thomas Lidbetter & László A. Végh, 2019. "On Submodular Search and Machine Scheduling," Management Science, INFORMS, vol. 44(4), pages 1431-1449, November.
    5. Lidbetter, Thomas, 2020. "Search and rescue in the face of uncertain threats," European Journal of Operational Research, Elsevier, vol. 285(3), pages 1153-1160.
    6. Alpern, Steve & Lidbetter, Thomas, 2020. "Search and Delivery Man Problems: When are depth-first paths optimal?," European Journal of Operational Research, Elsevier, vol. 285(3), pages 965-976.
    7. Lidbetter, Thomas & Lin, Kyle Y., 2019. "Searching for multiple objects in multiple locations," European Journal of Operational Research, Elsevier, vol. 278(2), pages 709-720.
    8. Bastián Bahamondes & Mathieu Dahan, 2024. "Hide-and-Seek Game with Capacitated Locations and Imperfect Detection," Decision Analysis, INFORMS, vol. 21(2), pages 110-124, June.
    9. Garrec, Tristan, 2019. "Continuous patrolling and hiding games," European Journal of Operational Research, Elsevier, vol. 277(1), pages 42-51.
    10. Hellerstein, Lisa & Lidbetter, Thomas, 2023. "A game theoretic approach to a problem in polymatroid maximization," European Journal of Operational Research, Elsevier, vol. 305(2), pages 979-988.
    11. Ferdinandy, B. & Ozogány, K. & Vicsek, T., 2017. "Collective motion of groups of self-propelled particles following interacting leaders," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 467-477.
    12. Bui, Thuy & Lidbetter, Thomas & Lin, Kyle Y., 2024. "Optimal pure strategies for a discrete search game," European Journal of Operational Research, Elsevier, vol. 313(2), pages 767-775.
    13. Lisa Hellerstein & Thomas Lidbetter & Daniel Pirutinsky, 2019. "Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games," Operations Research, INFORMS, vol. 67(3), pages 731-743, May.
    14. Steve Alpern, 2017. "Hide-and-Seek Games on a Network, Using Combinatorial Search Paths," Operations Research, INFORMS, vol. 65(5), pages 1207-1214, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:391:y:2021:i:c:s0096300320305750. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.