In game theory, a sequential game is a game where one player chooses their action before the others choose theirs.^{[1]} Importantly, the later players must have some information of the first's choice, otherwise the difference in time would have no strategic effect. Sequential games hence are governed by the time axis, and represented in the form of decision trees.
Sequential games with perfect information can be analysed mathematically using combinatorial game theory.
Decision trees are the extensive form of dynamic games that provide information on the possible ways that a given game can be played. They show the sequence in which players act and the number of times that they can each make a decision. 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. Payoffs of each player are also given at the decision nodes of the tree. Extensive form representations were introduced by Neumann and further developed by Kuhn in the earliest years of game theory between 1910–1930.^{[2]}
Repeated games are an example of sequential games. Players play a stage game and the result of this game will determine how the game continues. At every new stage, both players will have complete information on how the previous stages had played out. A discount rate between the values of 0 and 1 is usually taken into account when considering the payoff of each player in these games. Repeated games can illustrate the psychological aspect of these games, including trust and revenge, as each player makes a decision at every stage game based on how the game has been played out so far.^{[2]}
Unlike sequential games, simultaneous games do not have a time axis as players choose their moves without being sure of the other's, and are usually represented in the form of payoff matrices. Extensive form representations are usually used for sequential games, since they explicitly illustrate the sequential aspects of a game. Combinatorial games are usually sequential games.
Games such as chess, infinite chess, backgammon, tictactoe and Go are examples of sequential games. The size of the decision trees can vary according to game complexity, ranging from the small game tree of tictactoe, to an immensely complex game tree of chess so large that even computers cannot map it completely.^{[3]}
In sequential games with perfect information, a subgame perfect equilibrium can be found by backward induction.^{[4]}
YouTube Encyclopedic

1/3Views:19 298106 7682 177

Game Theory C: Nash, Dominant, and Sequential Games

Game Theory 101 MOOC (#16): Subgame Perfect Equilibrium

Simple Sequential Games
Transcription
See also
References
 ^ Brocas; Carrillo; Sachdeva (2018). "The Path to Equilibrium in Sequential and Simultaneous Games". Journal of Economic Theory. 178: 246–274. doi:10.1016/j.jet.2018.09.011.
 ^ ^{a} ^{b} Aumann, R. J. Game Theory.^{[full citation needed]}
 ^ Claude Shannon (1950). "Programming a Computer for Playing Chess" (PDF). Philosophical Magazine. 41 (314).
 ^ Aliprantis, Charalambos D. (August 1999). "On the backward induction method". Economics Letters. 64 (2): 125–131. doi:10.1016/s01651765(99)000683.