This paper establishes the generic finiteness of equilibrium outcome distributions for Sender-Receiver cheap-talk games. An equilibrium in a Sender-Receiver cheap-talk game is said to be in reduced form if every message is used by at least one type and no two messages provoke the same response. It is shown that, for a generic set of utilities on outcomes, a Sender-Receiver cheap-talk game has a finite number of reduced form equilibria. A corollary is that, for generic utilities, the set of probability distributions over outcomes generated by equilibria is finite. Because of the identification of terminal nodes for utility purposes, Sard's theorem is not applicable in the way it was used in Kreps and Wilson (1982), and a structurally different proof strategy is developed. Some additional characterization of the equilibria are obtained in the process of the proof.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Length: Date of creation: 21 Oct 1993 Date of revision: Handle: RePEc:wpa:wuwpga:9310002
Note: plain TeX Contact details of provider: Web page: http://129.3.20.41
For technical questions regarding this item, or to correct its listing, contact: (EconWPA).
Related research
Keywords:
Find related papers by JEL classification: C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory D8 - Microeconomics - - Information, Knowledge, and Uncertainty
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: