Computer Science – Computer Science and Game Theory
Scientific paper
2006-08-02
Computer Science
Computer Science and Game Theory
39 pages, appeared in The B.E. Journal of Theoretical Economics: Vol. 7 : Iss. 1 (Topics), Article 18. Available at: http://
Scientific paper
The rationalizability concept was introduced in \cite{Ber84} and \cite{Pea84} to assess what can be inferred by rational players in a non-cooperative game in the presence of common knowledge. However, this notion can be defined in a number of ways that differ in seemingly unimportant minor details. We shed light on these differences, explain their impact, and clarify for which games these definitions coincide. Then we apply the same analysis to explain the differences and similarities between various ways the iterated elimination of strictly dominated strategies was defined in the literature. This allows us to clarify the results of \cite{DS02} and \cite{CLL05} and improve upon them. We also consider the extension of these results to strict dominance by a mixed strategy. Our approach is based on a general study of the operators on complete lattices. We allow transfinite iterations of the considered operators and clarify the need for them. The advantage of such a general approach is that a number of results, including order independence for some of the notions of rationalizability and strict dominance, come for free.
No associations
LandOfFree
The Many Faces of Rationalizability 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 The Many Faces of Rationalizability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Many Faces of Rationalizability will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-264548