Many results on repeated games played by finite automata rely on the complexity of the exact implementation of a coordinated play of length n. For a large proportion of sequences, this complexity appears to be no less than n. We study the complexity of a coordinated play when allowing for a few...

We consider an experiment with a version of the Battle of the Sexes game with two-sided private information, allowing a possible round of either one-way or two-way cheap talk before the game is played. We compare different treatments to study truthful revelation of information and subsequent...

We consider an experiment with a version of the Battle of the Sexes game with two-sided private information, allowing a possible round of either one-way or two-way cheap talk before the game is played. We compare different treatments to study truthful revelation of information and subsequent...