Abstract: We introduce a new fixed point method to analyze cheap talk games, in the tradition of Crawford and Sobel (1982). We illustrate it in a class of one-dimensional games, where the sender’s bias may depend on the state of the world, and which contains Crawford and Sobel’s model as a special case. The method yields new results on the structure of the equilibrium set. For games in which the sender has an outward bias, i.e. the sender is more extreme than the receiver whenever the state of the world is extreme, we prove that for any positive integer k, there is an equilibrium with exactly k pools, and at least one equilibrium with an infinite number of pools. We discuss the extent to which the fixed point method can be used to address o...