scholarly journals Branching Time Logic, Perfect Information Games and Backward Induction

Author(s):  
Giacomo F. Bonanno
2004 ◽  
Vol 20 (1) ◽  
pp. 89-115 ◽  
Author(s):  
Thorsten Clausing

A syntactic formalism for the modeling of belief revision in perfect information games is presented that allows to define the rationality of a player's choice of moves relative to the beliefs he holds as his respective decision nodes have been reached. In this setting, true common belief in the structure of the game and rationality held before the start of the game does not imply that backward induction will be played. To derive backward induction, a “forward belief” condition is formulated in terms of revised rather than initial beliefs. Alternative notions of rationality as well as the use of knowledge instead of belief are also studied within this framework.


2004 ◽  
Vol 32 (3) ◽  
pp. 315-338 ◽  
Author(s):  
Stefano Demichelis ◽  
Klaus Ritzberger ◽  
Jeroen M. Swinkels

2017 ◽  
Vol 42 (2) ◽  
pp. 427-433
Author(s):  
P. Jean-Jacques Herings ◽  
Arkadi Predtetchinski

2013 ◽  
Vol 5 (1) ◽  
pp. 21-25
Author(s):  
Ewa Drabik

Abstract Certain type of perfect information games (PI-games), the so-called Banach-Mazur games, so far have not been applied in economy. The perfect information positional game is defined as the game during which at any time the choice is made by one of the players who is acquainted with the previous decision of his opponent. The game is run on the sequential basis. The aim of this paper is to discuss selected Banach-Mazur games and to present some applications of positional game


Sign in / Sign up

Export Citation Format

Share Document