A tutorial for computer scientists on finite extensive games with perfect information

TL;DR

This paper offers a comprehensive, accessible tutorial on finite extensive games with perfect information, emphasizing algorithmic and logical perspectives often overlooked in traditional economic and mathematical literature.

Contribution

It provides a self-contained, optimized presentation of known results, highlighting algorithmic and logical aspects for computer scientists.

Findings

Clarifies the structure of finite extensive games with perfect information.

Highlights the importance of algorithmic and logical approaches.

Synthesizes existing results in an accessible format.

Abstract

We provide a self-contained introduction to finite extensive games with perfect information. In these games players proceed in turns having, at each stage, finitely many moves to their disposal, each play always ends, and in each play the players have complete knowledge of the previously made moves. Almost all discussed results are well-known, but often they are not presented in an optimal form. Also, they usually appear in the literature aimed at economists or mathematicians, so the algorithmic or logical aspects are underrepresented.