Sciweavers

Share
FUIN
2010

Game Solution, Epistemic Dynamics and Fixed-Point Logics

8 years 8 months ago
Game Solution, Epistemic Dynamics and Fixed-Point Logics
Abstract. Current methods for solving games embody a form of “procedural rationality” that invites logical analysis in its own right. This paper is a brief case study of Backward Induction for extensive games, replacing earlier static logical definitions by stepwise dynamic ones. We consider a number of analysis from recent years that look different conceptually, and find that they are all mathematically equivalent. This shows how an abstract logical perspective can bring out basic invariant structure in games. We then generalize this to an exploration of fixed-point logics on finite trees that best fit game-theoretic equilibria. We end with some open questions that suggest a broader program for merging current computational logics with notions and results from game theory. This paper is largely a program for opening up an area: an extended version of the technical results will be found in the forthcoming dissertation [26].
Johan van Benthem, Amélie Gheerbrant
Added 25 Jan 2011
Updated 25 Jan 2011
Type Journal
Year 2010
Where FUIN
Authors Johan van Benthem, Amélie Gheerbrant
Comments (0)
books