Next Article in Journal
Estimating Functions of Distributions Defined over Spaces of Unknown Size
Next Article in Special Issue
Dynamical Structure of a Traditional Amazonian Social Network
Previous Article in Journal
Law of Multiplicative Error and Its Generalization to the Correlated Observations Represented by the q-Product
Previous Article in Special Issue
Diffusion Dynamics with Changing Network Composition
Article Menu

Export Article

Open AccessArticle
Entropy 2013, 15(11), 4648-4667; doi:10.3390/e15114648

From Observable Behaviors to Structures of Interaction in Binary Games of Strategic Complements

Center for the Study of Rationality, Hebrew University of Jerusalem, Givat Ram, Jerusalem 91904, Israel
Received: 3 July 2013 / Revised: 29 September 2013 / Accepted: 30 September 2013 / Published: 29 October 2013
(This article belongs to the Special Issue Social Networks and Information Diffusion)
View Full-Text   |   Download PDF [311 KB, uploaded 24 February 2015]   |  


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 (C). 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, L, there is a game in (a), such that its set of equilibria is L (we say that such a game expresses L); (2) We show that there exists a game in (b), whose set of equilibria contains a given collection, C, of subsets of N, if and only C satisfies the sparseness condition, and the smallest game in (a) expressing 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, C, if and only if C is a chain satisfying the sparseness condition. View Full-Text
Keywords: peer effects; social networks; strategic complements; simple games; weighted games peer effects; social networks; strategic complements; simple games; weighted games

Figure 1

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Rodríguez Barraquer, T. From Observable Behaviors to Structures of Interaction in Binary Games of Strategic Complements. Entropy 2013, 15, 4648-4667.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top