This paper studies a dynamic adjustment process in a large society of forward-looking agents where payoffs are given by a normal form supermodular game. The stationary states of the dynamics correspond to the Nash equilibria of the stage game. It is shown that if the stage game has a monotone...

We address the problem of a planner looking for the efficient network when agents play a network game with local complementarities and links are costly. We show that for general network cost functions, efficient networks belong to the class of Nested-Split Graphs. Next, we refine our results and...

This paper develops a simple model in which a social hierarchy emerges endogenously when agents form a network for complementary interaction (``activity''). Specifically, we assume that agents are ex ante identical and their best response activity, as well as their value function, increases...

This paper considers a population of agents that are engaged in a listening network. The agents wish to match their actions to the true value of some uncertain (exogenous) parameter and to the actions of the other agents. Each agent begins with some initial information about the parameter and,...

We report the findings of experiments designed to study how people learn in network games. Network games offer new opportunities to identify learning rules, since on networks (compared to, e.g., random matching) more rules differ in terms of their information requirements. Our experimental...

We study nonparametric identification of single-agent discrete choice models for bundles (without requiring bundle-specific prices) and of binary games of complete information. We show that these two models are quite similar from an identification standpoint. Moreover, they are mathematically...