IDEAS home Printed from https://ideas.repec.org/p/cda/wpaper/307.html
   My bibliography  Save this paper

Branching Time Logic, Perfect Information Games And Backward Induction

Author

Listed:
  • Michael Magill
  • Giacomo Bonanno
  • Kristin Van Gaasback

    (Department of Economics, University of California Davis)

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.

Suggested Citation

  • Michael Magill & Giacomo Bonanno & Kristin Van Gaasback, 2003. "Branching Time Logic, Perfect Information Games And Backward Induction," Working Papers 307, University of California, Davis, Department of Economics.
    • Handle: RePEc:cda:wpaper:307
    as

    Download full text from publisher

    File URL: https://repec.dss.ucdavis.edu/files/72HUZQ7wtGXC4WLX9SZoNzXQ/98-13.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Asheim, Geir B., 2002. "On the epistemic foundation for backward induction," Mathematical Social Sciences, Elsevier, vol. 44(2), pages 121-144, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cda:wpaper:307. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Letters and Science IT Services Unit (email available below). General contact details of provider: https://edirc.repec.org/data/educdus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.