The role of monotonicity in the epistemic analysis of strategic games (Q2344949)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6436593
Language Label Description Also known as
default for all languages
No label defined
    English
    The role of monotonicity in the epistemic analysis of strategic games
    scientific article; zbMATH DE number 6436593

      Statements

      The role of monotonicity in the epistemic analysis of strategic games (English)
      0 references
      0 references
      19 May 2015
      0 references
      Summary: 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.
      0 references
      true common beliefs
      0 references
      arbitrary games
      0 references
      monotonicity
      0 references
      Tarski's fixpoint theorem
      0 references

      Identifiers