Reasoning about Your Own Future Mistakes

We propose a model of reasoning in dynamic games in which a player, at each information set, holds a conditional belief about his own future choices and the opponents' future choices. These conditional beliefs are assumed to be cautious, that is, the player never completely rules out any feasible future choice by himself or the opponents. We impose the following key conditions: (a) a player always believes that he will choose rationally in the future, (b) a player always believes that his opponents will choose rationally in the future, and (c) a player deems his own mistakes infinitely less likely than the opponents' mistakes. These conditions, together with iterating property (b), lead to the new concept of perfect backwards rationalizability. We show that perfect backwards rationalizable strategies exist in every finite dynamic game. We prove, moreover, that perfect backwards rationalizability constitutes a refinement of both perfect rationalizability (a rationalizability analogue to Selten's (1975) perfect equilibrium) and procedural quasi-perfect rationalizability (a rationalizability analogue to van Damme's (1984) quasi-perfect equilibrium) – two concepts that are introduced in this paper. As a consequence, our concept avoids both weakly dominated strategies in the normal form and strategies containing weakly dominated actions in the agent normal form. For one-shot games, the concept coincides with permissibility (Brandenburger (1992), Börgers (1994)).

Authors

Publication Details

Journal
Games and Economic Behavior
Published
2025-10-01
DOI
https://doi.org/10.1016/j.geb.2025.09.010
Primary Topic
Game Theory and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Reasoning about Your Own Future Mistakes

Andrés Perea, Martin Meier
Games and Economic Behavior
Game Theory and Applications
article

Reasoning about Your Own Future Mistakes

Andrés Perea, Martin Meier
article en

Abstract

We propose a model of reasoning in dynamic games in which a player, at each information set, holds a conditional belief about his own future choices and the opponents' future choices. These conditional beliefs are assumed to be cautious, that is, the player never completely rules out any feasible future choice by himself or the opponents. We impose the following key conditions: (a) a player always believes that he will choose rationally in the future, (b) a player always believes that his opponents will choose rationally in the future, and (c) a player deems his own mistakes infinitely less likely than the opponents' mistakes. These conditions, together with iterating property (b), lead to the new concept of perfect backwards rationalizability. We show that perfect backwards rationalizable strategies exist in every finite dynamic game. We prove, moreover, that perfect backwards rationalizability constitutes a refinement of both perfect rationalizability (a rationalizability analogue to Selten's (1975) perfect equilibrium) and procedural quasi-perfect rationalizability (a rationalizability analogue to van Damme's (1984) quasi-perfect equilibrium) – two concepts that are introduced in this paper. As a consequence, our concept avoids both weakly dominated strategies in the normal form and strategies containing weakly dominated actions in the agent normal form. For one-shot games, the concept coincides with permissibility (Brandenburger (1992), Börgers (1994)).

Games and Economic Behavior
Openalex Percentile: Top 68%
Game Theory and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.