The UvA-LINKER will give you a range of other options to find the full text of a publication (including a direct link to the full-text if it is located on another database on the internet).
De UvA-LINKER biedt mogelijkheden om een publicatie elders te vinden (inclusief een directe link naar de publicatie online als deze beschikbaar is in een database op het internet).


Zoekopdracht: auteur: "benthem,j.f.a.k.van"

AuteursJ.F.A.K. van Benthem, A. Gheerbrant
TitelGame Solution, Epistemic Dynamics and Fixed-Point Logics
FaculteitFaculteit der Natuurwetenschappen, Wiskunde en Informatica
Instituut/afd.FNWI/FGw: Institute for Logic, Language and Computation (ILLC)
TrefwoordenBackward Induction, ExtensiveGames, Dynamic-Epistemic Logic, Fixed-Point Logic
SerieILLC Prepublications / ILLC ; PP-2011-28
SamenvattingCurrent 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 of the second author.
OpmerkingenAppeared in "Fundamenta Informaticae 100" (2010) 1–23.
Soort documentPreprint
Document finderUvA-Linker