Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Jake Clarkson"'
Publikováno v:
Mathematics of Operations Research. 48:687-707
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04ab8dadfc210c93b3ae6767c504cdb9
https://doi.org/10.1287/moor.2022.1279
https://doi.org/10.1287/moor.2022.1279
Publikováno v:
Production and Operations Management. 32:813-828
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9268e5a07fca04453dd3a4ce06acecf9
https://doi.org/10.1111/poms.13900
https://doi.org/10.1111/poms.13900
Autor:
Krishna Kalyanam, Jake Clarkson
Publikováno v:
Naval Research Logistics (NRL). 68:485-495
An attacker with homogeneous weapons aims to destroy a target via sequential engagements over a finite planning horizon. Each weapon, with an associated cost, has a nonzero probability of destroying the target. At each decision epoch, the attacker ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2a1beb87e09ee4f9de02c31ad988f94
https://doi.org/10.1002/nav.21967
https://doi.org/10.1002/nav.21967