Communication Equilibria with Partially Verifiable Types

This paper studies the set of equilibria that can be achieved by adding general communication systems to Bayesian games in which some information can be certified or, equivalently, in which players' types are partially verifiable. Certifiability of information is formalized by a set of available reports for each player that varies with the true state of the world. Given these state-dependent sets of reports, we characterize canonical equilibria for which generalized versions of the revelation principle are valid. Communication equilibria and associated canonical representations are obtained as special cases when no information can be certified.