Code and Data Repository for Computing Optimal Strategies for a Search Game in Discrete Locations
Jake Clarkson, Kyle Y. Lin · INFORMS journal on computing · 2024
This directory contains the code required to replicate the numerical experiments of Section 4 in the paper "Computing Optimal Strategies for a Search Game in Discrete Locations". The user should be able to exactly (apart from runtimes, which may vary from machine to machine) reproduce the results in Tables 2 and 3 in this paper, plus generate the data used in the analysis of Section 4.3. The code also allows the user to run a new numerical experiment with different parameters to those specified in Section 4 of the paper (e.g. different number of boxes, different number of search games, different parameters in equation (23)).