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...

We study a consumer non-sequential search oligopoly model with search cost heterogeneity. We first prove that an equilibrium in mixed strategies always exists. We then examine the nonparametric identification and estimation of the costs of search. We find that the sequence of points on the...