Agent Connectedness and Backward Induction

C.W. Bach, C. Heilmann

Research output: Contribution to journalArticleAcademicpeer-review


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.
Original languageEnglish
Pages (from-to)195-208
JournalInternational Game Theory Review
Issue number2
Publication statusPublished - 1 Jan 2011

Cite this