We use an extensive form, universal type space to provide the following epistemic characterisation of extensive form rationalisability. Say that player i strongly believes event E if i is certain of E conditional on each of her information sets consistent with E. Our main contribution is to show that a strategy profile s is extensive form rationalisable if and only if there is a state in which s is played and (0) everybody is rational, (1) everybody strongly believes (0), (2) everybody strongly believes (0) & (1), (3) everybody strongly believes (0) & (1) & (2), .... This result also allows us to provide sufficient epistemic conditions for the backward induction outcome and to relate extensive form rationalisability and conditional common certainty of rationality.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Fondazione Eni Enrico Mattei in its series Working Papers with number
1999.25.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Martin J. Osborne & Ariel Rubinstein, 1994.
"A Course in Game Theory,"
MIT Press Books,
The MIT Press,
edition 1, volume 1, number 0262650401.
Other versions:
Ronald Fagin & Joseph Y. Halpern & Yoram Moses & Moshe Y. Vardi, 2003.
"Reasoning About Knowledge,"
MIT Press Books,
The MIT Press,
edition 1, volume 1, number 0262562006.
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)