We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the 'same or better reply' correspondence (CUSOBR set) that...

We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that...

This paper deals with an extension of the concept of correlated strategies to Markov stopping games. The idea of this paper was presented at Game Theory and Mathematical Economics, International Conference in Memory of Jerzy Łoś (1920 - 1998), Warsaw, September 2004. The Nash equilibrium...

Regret-minimizing strategies for repeated games have been receiving increasing attention in the literature. These are simple adaptive behavior rules that lead to no regrets and, if followed by all players, exhibit nice convergence properties: the average play converges to correlated equilibrium,...

This paper builds on one of the results of Pruzhansky [22], namely that maximin strategies guarantee the same expected payoffs as mixed Nash equilibrium strategies in bimatrix games. We present a discussion on the applicability of maximin strategies in such class of games. The usefulness of...

A sunspot variable is any random variable that is not related to fundamental factors of the economy but a potential coordination device. The coordination power of sunspots has been analysed in theory and in experiments. However, some have discussed whether sunspots, e.g., public announcements...