Agent Connectedness And Backward Induction
We conceive of a player in dynamic games as a set of agents, which are assigned the distinct tasks of reasoning and node-specific choices. The notion of agent connectedness measuring the sequential stability of a player over time is then modeled in an extended type-based epistemic framework. Moreover, we provide an epistemic foundation for backward induction in terms of agent connectedness. Besides, it is argued that the epistemic independence assumption underlying backward induction is stronger than usually presumed.
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 13 (2011)
Issue (Month): 02 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/igtr/igtr.shtml|
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:wsi:igtrxx:v:13:y:2011:i:02:p:195-208. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)
If references are entirely missing, you can add them using this form.