AGENT CONNECTEDNESS AND BACKWARD INDUCTION

BACH, CHRISTIAN W ORCID: 0000-0003-0187-1820 and HEILMANN, CONRAD (2011) AGENT CONNECTEDNESS AND BACKWARD INDUCTION. International Game Theory Review, 13 (02). pp. 195-208.

Text
Bach and Heilmann (2012).pdf - Unspecified
Access to this file is embargoed until Unspecified.
Download (253kB)

Official URL: http://dx.doi.org/10.1142/s0219198911002940

Abstract

<jats:p> 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. </jats:p>

Item Type:	Article
Depositing User:	Symplectic Admin
Date Deposited:	10 Feb 2016 09:11
Last Modified:	22 Nov 2023 11:58
DOI:	10.1142/s0219198911002940
Related URLs:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/2050582