Computing Optimal Strategies for a Search Game in Discrete Locations

Jake Clarkson
Corresponding Author
Jake Clarkson
[email protected]
https://orcid.org/0000-0002-7006-4427
Centre Inria d’Université Côte d’Azur, 06902 Sophia Antipolis, France
Search for more papers by this author
,
Kyle Y. Lin
Kyle Y. Lin
[email protected]
https://orcid.org/0000-0002-3769-1891
Operations Research Department, Naval Postgraduate School, Monterey, California 93943
Search for more papers by this author

Corresponding Author

Jake Clarkson

[email protected]

https://orcid.org/0000-0002-7006-4427

Centre Inria d’Université Côte d’Azur, 06902 Sophia Antipolis, France

Search for more papers by this author

,

Kyle Y. Lin

[email protected]

https://orcid.org/0000-0002-3769-1891

Operations Research Department, Naval Postgraduate School, Monterey, California 93943

Search for more papers by this author

Published Online:9 Aug 2024https://doi.org/10.1287/ijoc.2023.0155

Supplemental Material

Code and Data Repository: ijoc.2023.0155.cd.zip

cover image INFORMS Journal on Computing

Volume 37, Issue 3

May-June 2025

Pages iii, 503-783, ii

Article Information

Supplemental Material

Metrics

Information

Received:May 16, 2023
Accepted:July 08, 2024
Published Online:August 09, 2024

Copyright © 2024, INFORMS

Cite as

Jake Clarkson; , Kyle Y. Lin (2024) Computing Optimal Strategies for a Search Game in Discrete Locations. INFORMS Journal on Computing 37(3):666-683.

https://doi.org/10.1287/ijoc.2023.0155

Keywords

Acknowledgments

The authors thank Kevin Glazebrook and Dashi Singham for discussions, the anonymous reviewers for helpful comments, and Dr. Oscar Dowson for suggestions to improve the code run time. Part of this work was done when Jake Clarkson was completing his PhD at Lancaster University.