At every new stage, both players will have complete information on how the previous stages had played out. Players perform a stage game and the results will determine how the game continues. Repeated games are an example of sequential games. Extensive form representations were introduced by Neumann and further developed by Kuhn in the earliest years of game theory between 1910–1930. Payoffs for each player are given at the decision nodes of the tree. Decision trees also provide information on what each player knows or does not know at the point in time they decide on an action to take. They show the sequence in which players act and the number of times that they can each make a decision. Sequential games with perfect information can be analysed mathematically using combinatorial game theory.ĭecision trees are the extensive form of dynamic games that provide information on the possible ways that a given game can be played. Sequential games are governed by the time axis and represented in the form of decision trees.
The other players must have information on the first player's choice so that the difference in time has no strategic effect. In game theory, a sequential game is a game where one player chooses their action before the others choose theirs. Chess is an example of a sequential game.