Let $\mathcal{R}_i$ be a non-empty, finite set and define the reporting correspondence $R_i:S→2^{\mathcal{R}_i}-\{\emptyset\}$ to be a mapping from player i’s type space to the collection of subsets of $\mathcal{R}_i$. An element $s\in\mathcal{R}_i$ is called a type dependent message and $R_i(s_i)$ is the set of type-dependent messages available to type $s_i$ of player $i$. Type-dependent messages certify a player’s statement about his type. For example, if $L\subset S_i$ is the set of types of player $i$ who can send the message $s\in\mathcal{R}_i$, then $s$ certifies a statement of the type “my type is in $L$”. The set $L$ is therefore called a certifiable event.
I want to define the reporting correspondence $R_i$ differently. Suppose that the game is repeated and at the end of every stage $t$ of the game and before a new one starts, every player observes the history of the game that is reached until that point. We denote the history of the game as $h$. It is the sequence of the past profile of strategies played by the players, namely $h=(a_k)_{k=1}^T$, where $a_k$ is the profile of strategies played in stage $k$. At the end of every stage $t$ of the game and before a new one starts, every player also gets an update for his type $s_i$ with respect to the type of the other players $s_{-i}$ denoted as $s_i^t$. So, given the history $h^{t-1}$ and the updated type $s_i^t$ how is the correspondence $R_i$ redifined?
I ask for something simple. The reporting correspondence is defined as $R_i:S→2^{\mathcal{R}_i}-\{\emptyset\}$. Whet the game takes the dynamic dimension due to the stages, then $R_i^t:\underbrace{...}_{?}\to\underbrace{...}_{?}$