Branching Time Logic, Perfect Information Games and Backward Induction

UC Davis Working Paper No. 98-13

26 Pages Posted: 5 Jan 1999

See all articles by Giacomo Bonanno

Giacomo Bonanno

University of California, Davis - Department of Economics

Date Written: November 1998

Abstract

The logical foundations of game-theoretic solution concepts have so far been developed within the confines of epistemic logic. In this paper we turn to a different branch of modal logic, namely temporal logic, and propose to view the solution of a game as a complete prediction about future play. We extend the branching time framework by adding agents and by defining the notion of prediction. We show that perfect information games are a special case of extended branching time frames and that the backward-induction solution is a prediction. We also provide a characterization of backward induction in terms of the property of internal consistency of prediction.

JEL Classification: C72

Suggested Citation

Bonanno, Giacomo F., Branching Time Logic, Perfect Information Games and Backward Induction (November 1998). UC Davis Working Paper No. 98-13. Available at SSRN: https://ssrn.com/abstract=140988 or http://dx.doi.org/10.2139/ssrn.140988

Giacomo F. Bonanno (Contact Author)

University of California, Davis - Department of Economics ( email )

One Shields Drive
Davis, CA 95616-8578
United States
916-752-1574 (Phone)
916-752-9382 (Fax)

Register to save articles to
your library

Register

Paper statistics

Downloads
77
Abstract Views
576
rank
311,909
PlumX Metrics