Computer Science – Computer Science and Game Theory
Scientific paper
2010-10-27
Games 2010, 1(4), 381-394; see http://www.mdpi.com/2073-4336/1/4/381/
Computer Science
Computer Science and Game Theory
20 pages
Scientific paper
10.3390/g1040381
It is well-known that in finite strategic games true common belief (or common knowledge) of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. We establish a general theorem that deals with monotonic rationality notions and arbitrary strategic games and allows to strengthen the above result to arbitrary games, other rationality notions, and transfinite iterations of the elimination process. We also clarify what conclusions one can draw for the customary dominance notions that are not monotonic. The main tool is Tarski's Fixpoint Theorem.
Apt Krzysztof R.
Zvesper Jonathan A.
No associations
LandOfFree
The Role of Monotonicity in the Epistemic Analysis of Strategic Games 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 Role of Monotonicity in the Epistemic Analysis of Strategic Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Role of Monotonicity in the Epistemic Analysis of Strategic Games will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-485042