Backward Induction in Games of Perfect Information

Abstract

Summary form only given. One of the areas of Game Theory that are of most interest to Computer Scientists, and in which Formal Logic is most heavily used, is that of Games of Perfect Information (like Chess or Checkers). Of central interest in this connectioOne of the areas of Game Theory that are of most interest to Computer Scientists, and in which Formal Logic is most heavily used, is that of Games of Perfect Information (like Chess or Checkers). Of central interest in this connection is the Backward Induction algorithm, which has generated a good deal of controversy, and with it, a large literature. We will review some of this literature, culminating with an as yet unpublished result of Itai Arieli and the speaker.n is the Backward Induction algorithm, which has generated a good deal of controversy, and with it, a large literature. We will review some of this literature, culminating with an as yet unpublished result of Itai Arieli and the speaker.