Published in

World Scientific Publishing, International Game Theory Review, 02(13), p. 195-208

DOI: 10.1142/s0219198911002940

Links

Tools

Export citation

Search in Google Scholar

Agent connectedness and backward induction

Journal article published in 2011 by Christian W. Bach, Conrad Heilmann
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

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.