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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by California Davis - Department of Economics in its series Department of Economics with number
98-13.
Length: Date of creation: Date of revision: Handle: RePEc:fth:caldec:98-13
Contact details of provider: Postal: University of California Davis - Department of Economics. One Shields Ave., California 95616-8578 Phone: (530) 752-0741 Fax: (530) 752-9382 Email: Web page: http://www.econ.ucdavis.edu/ More information through EDIRC
For technical questions regarding this item, or to correct its listing, contact: (Thomas Krichel).
Related research
Keywords:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)