Towards Selecting the Best Abstraction for a Patrolling Game

Authors

Anjon Basak, The University of Texas at El PasoFollow
Chris Kiekintveld, The University of Texas at El PasoFollow
Vladik Kreinovich, The University of Texas at El PasoFollow

Publication Date

12-2015

Comments

Technical Report: UTEP-CS-15-93

To appear in Journal of Uncertain Systems, 2017, Vol. 11.

Abstract

When the number of possible strategies is large, it is not computationally feasible to compute the optimal strategy for the original game. Instead, we select our strategy based on an approximate approximate description of the original game. The quality of the resulting strategy depends on which approximation we select. In this paper, on an example of a simple game, we show how to find the optimal approximation, the approximation whose use results in the best strategy.