On a game with perfect information and time-claiming alternatives

Abstract

This paper considers a new model of multistage games with perfect information in which players can control decision-making time. At each stage of the game, players choose a certain alternative from a finite set of basic alternatives and also time necessary to realize this basic alternative. The payoffs of players depend on the game path defined by the chosen alternatives and also on the time to realize this path at each stage. We use the subgame-perfect ε-Nash equilibrium as the optimality principle of the model. This paper is a continuation of the earlier research [5].