Two agents independently choose mixed m-recall strategies that take actions in finite action spaces A <Subscript>1</Subscript> and A <Subscript>2</Subscript>. The strategies induce a random play, a <Subscript>1</Subscript>, a <Subscript>2</Subscript>, . . ., where a <Subscript> t </Subscript> assumes values in A <Subscript>1</Subscript> × A <Subscript>2</Subscript>. An M-recall observer observes the play. The goal of the agents is to make the observer believe that the play is similar to a sequence of i.i.d. random actions whose distribution is <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${Q\in\Delta(A_1\times A_2)}$$</EquationSource> </InlineEquation>. For nearly every t, the following event should occur with probability close to one: “the distribution of a <Subscript> t+M </Subscript> given a <Subscript> t </Subscript>, . . . , a <Subscript> t+M-1</Subscript> is close to Q.” We provide a sufficient and necessary condition on m, M, and Q under which this goal can be achieved (for large m). This work is a step in the direction of establishing a folk theorem for repeated games with bounded recall. It tries to tackle the difficulty in computing the individually rational levels (IRL) in the bounded recall setting. Our result implies, for example, that in some games the IRL in the bounded recall game is bounded away below the IRL in the stage game, even when all the players have the same recall capacity. Copyright Springer-Verlag 2013
