From observable behaviors to structures of interaction in binary games of strategic complements (Q280676)

Summary: Consider a setting in which agents can take one of two ordered actions and in which the incentive to take the high action increases in the number of other agents taking it. Furthermore, assume that we do not know anything else about the game being played. What can we say about the details of the interaction between actions and incentives when we observe a set or a subset of all possible equilibria? In this paper, we study this question by exploring three nested classes of games: (a) binary games of strategic complements; (b) games in (a) that admit a network representation; and (c) games in (b) in which the network is complete. Our main results are the following: It has long been established in the literature that the set of pure strategy Nash equilibria of any binary game of strategic complements among a set, \(N\), of agents can be seen as a lattice on the set of all subsets of \(N\) under the partial order defined by the set inclusion relation \((\subseteq)\). If the game happens to be strict in the sense that agents are never indifferent among outcomes (games in (a)), then the resulting lattice of equilibria satisfies a straightforward sparseness condition. (1) We show that, in fact, for each such lattice, \(\mathcal L\), there is a game in (a), such that its set of equilibria is \(\mathcal L\) (we say that such a game expresses \(\mathcal L\)); (2) We show that there exists a game in (b), whose set of equilibria contains a given collection, \(\mathcal C\), of subsets of \(N\), if and only \(\mathcal C\) satisfies the sparseness condition, and the smallest game in (a) expressing \(\mathcal C\) is trade robust; (3) We show that there exists a game on the complete graph (games in (c)), whose set of equilibria coincides with some collection, \(\mathcal C\), if and only if \(\mathcal C\) is a chain satisfying the sparseness condition.