We present an algorithm for solving S-Games. Our\ud algorithm can be used to compute approximately the\ud value of the game as well as €-optimal strategies of\ud the two players. For games with similar structure to\ud S-games which do not necessarily possess a value, the\ud algorithm can sometimes be used as a heuristic procedure\ud for determining the existence of a minimax\ud solution. Further, it is shown that a certain simple\ud class of differential games (we call them "differential\ud S-games") can be viewed as static games and solved\ud by the above procedure
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.