Library Header Image
LSE Research Online LSE Library Services

Correlation through bounded recall strategies

Peretz, Ron (2013) Correlation through bounded recall strategies. International Journal of Game Theory, 42 (4). pp. 867-890. ISSN 0020-7276

Full text not available from this repository.
Identification Number: 10.1007/s00182-012-0334-x


Two agents independently choose mixed m-recall strategies that take actions in finite action spaces A 1 and A 2. The strategies induce a random play, a 1, a 2, . . ., where a t assumes values in A 1 × A 2. 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 Q∈Δ(A1×A2) . For nearly every t, the following event should occur with probability close to one: “the distribution of a t+M given a t , . . . , a t+M-1 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.

Item Type: Article
Official URL:
Additional Information: © 2012 Springer
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 23 Nov 2012 12:08
Last Modified: 20 Aug 2021 00:53
Projects: #212/09
Funders: Israel Science Foundation, Google Inter-university center for Electronic Markets and Auctions

Actions (login required)

View Item View Item