Currently no refinement exists that successfully selects equilibria across a wider range of Cheap Talk games. We propose a generalization of refinements based on credible deviations, such as neologism proofness and announcement proofness. According to our Average Credible Deviation Criterion...

In~[1], authors consider a general model of dynamic game of asymmetric information, where N players have types evolving as independent Markovian process, where each player observes its own type perfectly and actions of all players. The authors present a sequential decomposition algorithm to find...