Generalized notions of potential maximizer, monotone potential maximizer (MP-maximizer) and local potential maximizer (LP-maximizer), are studied. It is known that 2x2 coordination games generically have a potential maximizer, while symmetric 4x4 supermodular games may have no MP- or...

For binary-action supermodular games with a continuum of symmetric players, we show that simple global game information structures can be used to implement an optimal outcome under adversarial equilibrium selection

We characterize global game selections in binary-action supermodular games in terms of sequential obedience: it is shown that an action profile of a binary-action supermodular game is a (possibly noise-dependent) global game selection if and only if it satisfies strict sequential obedience and...

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

This paper studies the robustness of an equilibrium to incomplete information in binary-action supermodular games. Using a generalized version of belief operator, we explore the restrictions that prior beliefs impose on higher order beliefs. In particular, we obtain a non-trivial lower bound on...

In a setting where an infinite population of players interact locally and repeatedly, we study the impacts of payoff structures and network structures on contagion of a convention. For the "bilingual game", where each player chooses one of two conventions or adopts both (i.e., chooses the...

This paper studies equilibrium selection in binary supermodular games based on perfect foresight dynamics. We provide complete characterizations of absorbing and globally accessible equilibria and apply them to two subclasses of games. First, for unanimity games, it is shown that our selection...