Learning across games

This paper studies the learning process carried out by two agents who are involved in many games. As distinguishing all games can be too costly (require too much reasoning resources) agents might partition the set of all games into categories. Partitions of higher cardinality are more costly. A process of simultaneous learning of actions and partitions is presented and equilibrium partitions and action choices characterized. Learning across games can destabilize strict Nash equilibria even for arbitrarily small reasoning costs and even if players distinguish all the games at the stable point. The model is also able to explain experimental findings from the traveler's dilemma and deviations from subgame perfection in bargaining games.