Reasoning about rationality

We provide a sound and complete axiomatization for a class of logics appropriate for reasoning about the rationality of players in games, and show that essentially the same axiomatization applies to a very wide class of decision rules. We also consider games in which players may be uncertain as to what decision rules their opponents are using, and define in this context a new solution concept, D-rationalizability.