Agent connectedness and backward induction

Abstract
We analyze the sequential structure of dynamic games with perfect information. A three-stage account is proposed, that species setup, reasoning and play stages. Accordingly, we define a player as a set of agents corresponding to these three stages. The notion of agent connectedness is introduced into a type-based epistemic model. Agent connectedness measures the extent to which agents' choices are sequentially stable. Thus describing dynamic games allows to more fully understand strategic interaction over time. In particular, we provide suffcient conditions for backward induction in terms of agent connectedness. Also, our framework makes explicit that the epistemic independence assumption involved in backward induction reasoning is stronger than usually presumed, and makes accessible multiple-self interpretations for dynamic games
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,827
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Added to PP index
2010-07-25

Total downloads
12 ( #411,221 of 2,210,106 )

Recent downloads (6 months)
1 ( #382,810 of 2,210,106 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature