Correlated equilibria in repeated games with lack of information on one side: A model with verifiable types (Q1075959)

The author considers games with lack of information on one side where the uncertainty of the uninformed player concerns the type of his opponent. Two solution concepts are compared: the correlated equilibrium and the noisy channel equilibrium. It is shown that with verifiable types every correlated equilibrium payoff is a noisy channel equilibrium payoff, but not conversely. This contrasts with the earlier result that with unverifiable types, correlated equilibria are payoff-equivalent to noisy channel equilibria. It shows also that the verifiable and the unverifiable model which are known to be equivalent as far as Nash equilibria are concerned, differ with respect to correlated equilibria.