This paper looks at simple games with one round of pre-play communication followed by a simultaneous move, complete information game. In these games the {\em curb} concept distinguishes among efficient equilibria according to their risk. The paper contains two major results. First, if only one...

This paper examines sets of Nash equilibria in sender-receiver games that are stable against replacement by alternative Nash equilibria. Such stable sets exist. In {\em partial common interest games} they contain only informative equilibria. The stability requirement sharpens currently available...

This paper examines sets of Nash equilibria in sender-receiver games that are stable against replacement by alternative Nash equilibria. Such stable sets exist. In {\em partial common interest games} they contain only informative equilibria. The stability requirement sharpens currently available...

This paper studies the evolution of effective pre-play communication in games where a single communication round precedes a simultaneous-move, complete-information game. The paper identifies stable outcomes under population learning dynamics in which individuals with some probability replace...