Agent Connectedness and Backward Induction

International Game Theory Review 13 (2):195-208 (2011)
Abstract
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.
Keywords Backward induction  Epistemic independence  Interactive epistemology  Multiple-selves
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index Translate to english
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 10,731
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.

Citations of this work BETA

No citations found.

Similar books and articles
Joe Mintoff (1999). Decision-Making and the Backward Induction Argument. Pacific Philosophical Quarterly 80 (1):64–77.
Analytics

Monthly downloads

Added to index

2012-04-05

Total downloads

14 ( #112,549 of 1,098,628 )

Recent downloads (6 months)

5 ( #57,338 of 1,098,628 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Start a new thread
Order:
There  are no threads in this forum
Nothing in this forum yet.