University of Amsterdam
5pm Wednesday, 14th April, 2010
Room 4.40, Informatics Forum
Current methods for solving games embody a form of procedural rationality that invites logical analysis in its own right. The talk will be a brief case study of Backward Induction for extensive games, replacing earlier static logical definitions by dynamic ones. We will then generalize the analysis to a discussion of fixed-point logics on finite game trees that best fit game-theoretic equilibria. We will end with some open questions that suggest a broader program for merging current computational logics with notions and results from game theory.
This is joint work with Johan van Benthem.