Incomplete information and iterated strict dominance

Christian W. Bach*, Andres Perea

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

The solution concept of iterated strict dominance for static games with complete information recursively deletes choices that are inferior. Here, we devise such an algorithm for the more general case of incomplete information. The ensuing solution concept of generalized iterated strict dominance is characterized in terms of common belief in rationality as well as in terms of best response sets. Besides, we provide doxastic conditions that are necessary and sufficient for modelling complete information from a one-person perspective.
Original languageEnglish
Pages (from-to)820-836
Number of pages17
JournalOxford Economic Papers-New Series
Volume73
Issue number2
DOIs
Publication statusPublished - Apr 2021

JEL classifications

  • c72 - Noncooperative Games

Keywords

  • INTERACTIVE EPISTEMOLOGY
  • BELIEF
  • GAMES

Cite this