We study (anti-) coordination problems in networks in a laboratory experiment. Participants interact with their neighbours in a fixed network to play a bilateral (anti-) coordination game. Our main treatment variable is the extent to which players are heterogeneous in the number of connections...

We examine a new class of games, which we call social games, where players not only choose strategies but also choose with whom they play. A group of players who are dissatisfied with the play of their current partners can join together and play a new equilibrium. This imposes new refinements on...

We examine a simple bargaining setting, where heterogeneous buyers and sellers are repeatedly matched with each other. We begin by characterizing efficiency in such a dynamic setting, and discuss how it differs from efficiency in a centralized static setting. We then study the allocations which...

We examine how the speed of learning and best-response processes depends on homophily: the tendency of agents to associate disproportionately with those having similar traits. When agents' beliefs or behaviors are developed by averaging what they see among their neighbors, then convergence to a...

We develop a simple model to study the coevolution of interaction structures and action choices in Prisoners' Dilemma games. Agents are boundedly rational and choose both actions and interaction partners via payoff-based imitation. The dynamics of imitation and exclusion yields polymorphic...

We investigate the role of networks of alliances in preventing (multilateral) interstate wars. We first show that, in the absence of international trade, no network of alliances is peaceful and stable. We then show that international trade induces peaceful and stable networks: trade increases...

We study learning and influence in a setting where agents communicate according to an arbitrary social network and naively update their beliefs by repeatedly taking weighted averages of their neighbors' opinions. A focus is on conditions under which beliefs of all agents in large societies...

We study extrapolation between games in a laboratory experiment. Participants in our experiment first play either the dominance solvable guessing game or a Coordination version of the guessing game for five rounds. Afterwards they play a 3x3 normal form game for ten rounds with random matching...

We present a model of network formation where entering nodes find other nodes to link to both completely at random and through search of the neighborhoods of these randomly met nodes. We show that this model exhibits the full spectrum of features that have been found to characterize large...

Exploiting small uncertainties on the part of opponents, players in long, finitely repeated games can maintain false reputations that lead to a large variety of equilibrium outcomes. Even cooperation in a finitely repeated prisoners' dilemma is obtainable. Can such false reputations be...