2000 character limit reached
Epistemic Analysis of Strategic Games with Arbitrary Strategy Sets
Published 7 Jun 2007 in cs.GT and cs.AI | (0706.1001v1)
Abstract: We provide here an epistemic analysis of arbitrary strategic games based on the possibility correspondences. Such an analysis calls for the use of transfinite iterations of the corresponding operators. Our approach is based on Tarski's Fixpoint Theorem and applies both to the notions of rationalizability and the iterated elimination of strictly dominated strategies.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.