DeepAI AI Chat
Log In Sign Up

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

by   Krzysztof R. Apt, et al.

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.


page 1

page 2

page 3

page 4


A complete solution for a nontrivial ruleset with entailing moves

Combinatorial Game Theory typically studies sequential rulesets with per...

Kuhn's Equivalence Theorem for Games in Product Form

We propose an alternative to the tree representation of extensive form g...

Self-confirming Games: Unawareness, Discovery, and Equilibrium

Equilibrium notions for games with unawareness in the literature cannot ...

Sampled Fictitious Play is Hannan Consistent

Fictitious play is a simple and widely studied adaptive heuristic for pl...

Some Structure Properties of Finite Normal-Form Games

Game theory provides a mathematical framework for analysing strategic si...

Search in Imperfect Information Games

From the very dawn of the field, search with value functions was a funda...

Kuhn's Equivalence Theorem for Games in Intrinsic Form

We state and prove Kuhn's equivalence theorem for a new representation o...