Please use this identifier to cite or link to this item:
Title: A structure theorem for rationalizability in the normal form of dynamic games
Authors: Chen, Y.-C. 
Keywords: Extensive-form games
Higher-order beliefs
Incomplete information
Universal type space
Issue Date: Jul-2012
Source: Chen, Y.-C. (2012-07). A structure theorem for rationalizability in the normal form of dynamic games. Games and Economic Behavior 75 (2) : 587-597. ScholarBank@NUS Repository.
Abstract: We prove that the structure theorem for rationalizability originally from Weinstein and Yildiz (2007) applies to any finite extensive-form game with perfect recall and suitably rich payoffs. We demonstrate that the ties induced by the extensive form do not change the result of Weinstein and Yildiz (2007). Specifically, like Weinstein and Yildiz (2007), we adopt the normal-form concept of interim correlated rationalizability and we assume that players have no relevant knowledge of the extensive-form payoff structure. The extensive-form result is weaker in the sense that while the result of Weinstein and Yildiz (2007) does not depend on the latter assumption, our result does. Our result implies that without restrictions on players' knowledge of payoffs, the dynamic structure of extensive-form games offers no force for robust refinements of rationalizability. We also strengthen the main selection result of Weinstein and Yildiz (2007) by showing that the result holds for any (not necessarily finite) type. © 2012 Elsevier Inc.
Source Title: Games and Economic Behavior
ISSN: 08998256
DOI: 10.1016/j.geb.2012.02.006
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Dec 11, 2017


checked on Dec 11, 2017

Page view(s)

checked on Dec 9, 2017

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.