Multistep games with information lag

One investigates multistep antagonistic games with a variable information lag with alternative sets of arbitrary cardinality. One gives a theorem on the properties of the measure on the set of the trajectories of the game, induced by measurable behavior strategies, and a functional relation which generalizes Bellman's optimality principle. One shows the validity of the results for the general case of dynamical games.