We show that in all (whether generic or nongeneric) binary-action supermodular games, an extreme action profile is robust to incomplete information if and only if it is a monotone potential maximizer. The equivalence does not hold for nonextreme action profiles

Mixed‐strategy Nash equilibrium is the cornerstone of our understanding of strategic situations that require decision makers to be unpredictable. Using data from nearly half a million serves over 3000 tennis matches, and data on player rankings from the ATP and WTA, we examine whether the...

Media content is an important privately supplied public good. While it has been shown that contributions to a public good crowd out other contributions in many cases, the issue has not been thoroughly studied for media markets yet. We show that in a standard model of commercial media bias,...

In dynamic environments, Q-learning is an adaptative rule that provides an estimate (a Q-value) of the continuation value associated with each alternative. A naive policy consists in always choosing the alternative with highest Q-value. We consider a family of Q-based policy rules that may...

Cournot and Bertrand oligopoly equilibria are usually explained by strategic interactions, e.g., the best-replies. However, the best-replies often do not converge, require unrealistic information, suffer inconsistency, and exclude small firms. Alternatively, every firm may choose its output or...

This paper presents a general closed graph property for (randomized strategy) Nash equilibrium correspondence in large games. In particular, we show that for any large game with a convergent sequence of finite-player games, the limit of any convergent sequence of Nash equilibria of the...