ALGORITHM FOR CONSTRUCTING LOCALLY OPTIMAL STRATEGY FOR THE FIRST PLAYER IN A GAME PROBLEM WITH ARBITRARY SITUATIONS
摘要
We examine a two-player alternating-move game in which the first player chooses a strategy and the response of the second player depends on the choice of the first player. Under certain assumptions, an algorithm for constructing a locally optimal strategy for the first player is proposed and illustrated with an example.