I present a game-theoretic model where economic competition and attention competition are interdependent. On the one hand the effort to attract consumer attention depends on the value of attention to the firm which depends on the grade of price competition among all perceived firms. On the other...

We examine communication in a two-player coordination game with Pareto-ranked equilibria. Prior research demonstrates that efficient coordination is difficult without communication but obtains regularly with (mandatory) costless pre-play messages. In a laboratory experiment, we introduce two...

A strategy profile of a game is called robustly stochastically stable if it is stochastically stable for a given behavioral model independently of the specification of revision opportunities and tie-breaking assumptions in the dynamics. We provide a simple radius-coradius result for robust...

We study communication in a static Cournot duopoly model under the assumption that the firms have unverifiable private information about their costs. We show that cheap talk between the firms cannot transmit any information. However, if the firms can communicate through a third party,...

We study communication in a two-player coordination game with Pareto-ranked equilibria. Prior research demonstrates that efficient coordination is difficult without communication but obtains regularly with (mandatory) costless pre-play messages. In a laboratory experiment, we modify...

A strategy profile of a game is called robustly stochastically stable if it is stochastically stable for a given behavioral model independently of the specification of revision opportunities and tie-breaking assumptions in the dynamics. We provide a simple radius-coradius result for robust...

The paper analyzes the role of the structure of communication - i.e. who is talking with whom - on the choice of messages, on their credibility and on actual play. We run an experiment in a three-player coordination game with Pareto ranked equilibria, where a pair of agents has a profitable...

We consider the regret matching process with finite memory. For general games in normal form, it is shown that any recurrent class of the dynamics must be such that the action profiles that appear in it constitute a closed set under the “same or better reply” correspondence (CUSOBR set) that...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...