Home > Research > Publications & Outputs > A Classical Search Game In Discrete Locations

Research

Associated organisational unit

Electronic data

  • SearchGame_resub_2_to_KG

    Accepted author manuscript, 476 KB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

A Classical Search Game In Discrete Locations

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

A Classical Search Game In Discrete Locations. / Clarkson, Jake; Lin, Kyle; Glazebrook, Kevin.
In: Mathematics of Operations Research, Vol. 48, No. 2, 31.05.2023, p. 687-707.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Clarkson, J, Lin, K & Glazebrook, K 2023, 'A Classical Search Game In Discrete Locations', Mathematics of Operations Research, vol. 48, no. 2, pp. 687-707. https://doi.org/10.1287/moor.2022.1279

APA

Clarkson, J., Lin, K., & Glazebrook, K. (2023). A Classical Search Game In Discrete Locations. Mathematics of Operations Research, 48(2), 687-707. https://doi.org/10.1287/moor.2022.1279

Vancouver

Clarkson J, Lin K, Glazebrook K. A Classical Search Game In Discrete Locations. Mathematics of Operations Research. 2023 May 31;48(2):687-707. Epub 2022 Jul 1. doi: 10.1287/moor.2022.1279

Author

Clarkson, Jake ; Lin, Kyle ; Glazebrook, Kevin. / A Classical Search Game In Discrete Locations. In: Mathematics of Operations Research. 2023 ; Vol. 48, No. 2. pp. 687-707.

Bibtex

@article{3029000fee684d03a7ae373280693b66,
title = "A Classical Search Game In Discrete Locations",
abstract = "Consider a two-person zero-sum search game between a hider and a searcher. The hider hides among n discrete locations, and the searcher successively visits individual locations until finding the hider. Known to both players, a search at location i takes ti time units and detects the hider—if hidden there—independently with probability αi, for i = 1,...,n. The hider aims to maximize the expected time until detection, while the searcher aims to minimize it. We prove the existence of an optimal strategy for each player. In particular, any optimal mixed hiding strategy hides in each location with a nonzero probability, and there exists an optimal mixed search strategy which can be constructed with up to n simple search sequences.",
author = "Jake Clarkson and Kyle Lin and Kevin Glazebrook",
year = "2023",
month = may,
day = "31",
doi = "10.1287/moor.2022.1279",
language = "English",
volume = "48",
pages = "687--707",
journal = "Mathematics of Operations Research",
issn = "0364-765X",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "2",

}

RIS

TY - JOUR

T1 - A Classical Search Game In Discrete Locations

AU - Clarkson, Jake

AU - Lin, Kyle

AU - Glazebrook, Kevin

PY - 2023/5/31

Y1 - 2023/5/31

N2 - Consider a two-person zero-sum search game between a hider and a searcher. The hider hides among n discrete locations, and the searcher successively visits individual locations until finding the hider. Known to both players, a search at location i takes ti time units and detects the hider—if hidden there—independently with probability αi, for i = 1,...,n. The hider aims to maximize the expected time until detection, while the searcher aims to minimize it. We prove the existence of an optimal strategy for each player. In particular, any optimal mixed hiding strategy hides in each location with a nonzero probability, and there exists an optimal mixed search strategy which can be constructed with up to n simple search sequences.

AB - Consider a two-person zero-sum search game between a hider and a searcher. The hider hides among n discrete locations, and the searcher successively visits individual locations until finding the hider. Known to both players, a search at location i takes ti time units and detects the hider—if hidden there—independently with probability αi, for i = 1,...,n. The hider aims to maximize the expected time until detection, while the searcher aims to minimize it. We prove the existence of an optimal strategy for each player. In particular, any optimal mixed hiding strategy hides in each location with a nonzero probability, and there exists an optimal mixed search strategy which can be constructed with up to n simple search sequences.

U2 - 10.1287/moor.2022.1279

DO - 10.1287/moor.2022.1279

M3 - Journal article

VL - 48

SP - 687

EP - 707

JO - Mathematics of Operations Research

JF - Mathematics of Operations Research

SN - 0364-765X

IS - 2

ER -