Games of timing related to distribution of resources

The paper considers a class of zero-sum, two-person games which are related to distribution of resources. Each of the players is in possession of an amount of resource, to be distributed by him in the time interval [0, 1] according to an arbitrary measure. The payoff function is defined in such a manner that the games are a generalization of the so-called silent, nondiscrete duels. It is proven that these games have a value, and the optimal strategies for the players are found. The results of the paper bring to light new, essential elements, common to almost all games of timing on [0, 1].