Computer Science – Computer Science and Game Theory
Scientific paper
2007-06-07
Computer Science
Computer Science and Game Theory
8 pages Proc. of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK XI), 2007. To appear
Scientific paper
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.
No associations
LandOfFree
Epistemic Analysis of Strategic Games with Arbitrary Strategy Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Epistemic Analysis of Strategic Games with Arbitrary Strategy Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Epistemic Analysis of Strategic Games with Arbitrary Strategy Sets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-442217