We study the strategic disclosure of demand information and product-market strategies of duopolists. In a setting where both firms receive information with some probability, we show that firms selectively disclose information in equilibrium in order to influence their competitorś product-market...

Counterfactual policy evaluation often requires computation of game-theoretic equilibria. We provide new algorithms for computing pure-strategy Nash equilibria of games on networks with finite action spaces. The algorithms exploit the fact that many agents may be endowed with types such that a...

This paper generalizes the concept of Bayes' correlated equilibrium Bergemann and Morris (2016) to multistage games. We apply our characterization results to a number of illustrative examples and applications.

Refinements of the Nash equilibrium have followed the strategy of extending the idea of subgame perfection to incomplete information games. This has been achieved by appropriately restricting beliefs at unreached information sets. Each new refinement gives stricter and more...

Games with imperfect information often feature multiple equilibria, which depend on beliefs off the equilibrium path. Standard selection criteria such as passive beliefs, symmetric beliefs or wary beliefs rest on ad hoc restrictions on beliefs. We propose a new selection criterion that imposes...

This paper derives sufficient conditions for a class of games of incomplete information, such as first price auctions, to have pure strategy Nash equilibria (PSNE). The paper treats games between two or more heterogeneous agents, each with private information about his own type (for example, a...

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...