The algorithm searching Nash equilibria in dynamic network game

We carry out the assimilation of network formation game, which allows simultaneous actions. This is a dynamic network game with arcs of two kinds: interactional arches and dynamic arches. We have set an algorithm for retrieval of Nash equilibrium in a dynamic network game, which is a modification of the recurrent algorithm for multistage game, and uses the interactional arches' properties. We have estimated the complexity of the algorithm. An example is constructed, which shows the advantages of the modified algorithm in comparison to the standard recurrent algorithm for multistage game.