Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    RATIONALIZATION IN SIGNALING GAMES: THEORY AND APPLICATIONS

    Focusing on signaling games, I illustrate the relevance of the rationalizability approach for the analysis multistage games with incomplete information. I define a class of iterative solution procedures, featuring a notion of "forward induction": the Receiver tries to explain the Sender's message in a way which is consistent with the Sender's strategic sophistication and certain given restrictions on beliefs. The approach is applied to some numerical examples and economic models. In a standard model with verifiable messages a full disclosure result is obtained. In a model of job market signaling the best separating equilibrium emerges as the unique rationalizable outcome only when the high and low types are sufficiently different. Otherwise, rationalizability only puts bounds on the education choices of different types.