Parallel algorithm to find the Stackelberg equilibrium profiles

In the paper “Parallel Algorithm To Find The Stackelberg Equilibrium Profiles In The Three Stage Dynamic Games With Discrete Payoff Functions” we present a theoretical and practical study of the methods for solving dynamical games using parallel programming methods. In the chapter “Dynamical games with complete information” we present the theoretical information about dynamic games with complete information also the normal forms and the expanded forms of the dynamic games. All theoretical notions are explained by examples. In the chapter “Parallel algorithm to find the Stackelberg equilibrium profile in the three level dynamic games with discrete payoff functions” it is presented the basic information of parallel programming theory on the DMM HPC systems. In this chapter there are described the used MPI basic functions. Also in this chapter it is presented a parallel algorithm for determination of Stackelberg equilibrium profiles in the three stage dynamic games and analyze the algorithm time-run complexity. This paper is addressed to all scientists who use the dynamical games and parallel programming for modelling decision making problems.