  For cheap-talk games with a binary state space in which the sender has
state-independent preferences, we characterize equilibria that are robust to
introducing slight state-dependence on the side of the sender. Not all
equilibria are robust, but the sender-optimum is always achieved at some robust
equilibrium.
