We call a correspondence, defined on the set of mixed strategy pro les, a generalized best reply correspondence if it (1) has a product structure, (2) is upper hemi-continuous, (3) always includes a best reply to any mixed strategy pro le, and (4) is convex- and closed-valued. For each...

This paper studies the existence of equilibrium solution concepts in a large class of economic models with discontinuous payoff functions. The issue is well understood for Nash equilibria, thanks to Reny’s better-reply security con- dition ( Reny 1999) and its recent improvements (Barelli and...

We propose a bargaining process supergame over the strategies to play in a non-cooperative game. The agreement reached by players at the end of the bargaining process is the strategy profile that they will play in the original non-cooperative game. We analyze the subgame perfect equilibria of...

We design experimental games to evaluate the predictive power of the first cheap‐talk refinement, neologism‐proofness. In our first set of treatments designed to evaluate the refinement with its usual emphasis on literal meanings, we find that a fully revealing equilibrium that is...

We define a concept of epistemic robustness in the context of an epistemic model of a finite normal-form game where a player type corresponds to a belief over the profiles of opponent strategies and types. A Cartesian product X of pure-strategy subsets is epistemically robust if there is a...

This paper studies information transmission in a two-sender, multidimensional cheap talk setting where there are exogenous constraints on the (convex) feasible set of policies for the receiver and where the receiver is uncertain about both the directions and the magnitudes of the senders' bias...

We investigate situations in which agents can communicate to each other only through a chain of intermediators, for example because they have to obey institutionalized communication protocols. We assume that all involved in the communication are strategic, and might want to influence the action...

We characterize revenue maximizing mechanisms in a common value environment where the value of the object is equal to the highest of bidders’ independent signals. If the object is optimally sold with probability one, then the optimal mechanism is simply a posted price, with the highest...

A game of incomplete information can be decomposed into a basic game and an information structure. The basic game defines the set of actions, the set of payoff states the payoff functions and the common prior over the payoff states. The information structure refers to the signals that the...