Institute for Logic, Language and Computation

2 February 2006, Computational Social Choice Seminar, Krzysztof Apt

Speaker: Krzysztof Apt
Title: The Many Faces of Rationalizability
Date: Thursday 2 February 2006
Time: 16:00
Location: P-3.27, Euclides Building, Plantage Muidergracht 24, Amsterdam

The rationalizability concept was introduced in (Bernheim 84) and (Pearson 84) to assess what can be inferred by rational players in a non-cooperative game in presence of common knowledge. However, this notion can be defined in a number ways that differ in seemingly unimportant minor details. We shed light on these differences, explain their impact, and clarify for which games these notions coincide. Also we apply the same analysis to clarify the differences and similarities between various ways iterated elimination of strictly dominated strategies was defined in the literature.

The paper is available at For more information, please contact Ulle Endriss ().

The websites of the UvA make use of cookiesThis site uses cookies More informationMore info Hide this message XHide X