We examine the dynamic formation and stochastic evolution of networks connecting individuals. The payoff to an individual from an economic or social activity depends on the network of connections among individuals. Over time individuals form and sever links connecting themselves to other individuals based on the improvement that the resulting network offers them relative to the current network. In addition to intended changes in the network there is a small probability of unintended changes or errors. Predictions can be made regarding the likelihood that the stochastic process will lead to any given network at some time, where the stochastic process selects from among the statically stable networks and cycles. We apply these results to examples including the Gale–Shapley marriage problem. Thus the paper achieves two goals. First, it outlines a dynamic solution concept for networks. Second, it applies this concept to matching problems.

Economists have long been ambivalent about whether the discipline should focus on the analysis of markets or should be concerned with social interactions more generally. Recently the discipline has sought to broaden its scope while maintaining the rigor of modern economic analysis. Major theoretical developments in game theory, the economics of the family, and endogenous growth theory have taken place. Economists have also performed new empirical research on social interactions, but the empirical literature does not show progress comparable to that achieved in economic theory. This paper examines why and discusses how economists might make sustained contributions to the empirical analysis of social interactions.

Reinforcement learning can provide a robust and natural means for agents to learn how to coordinate their action choices in multiagent systems. We examine some of the factors that can influence the dynamics of the learning process in such a setting. We first distinguish reinforcement learners that are unaware of (or ignore) the presence of other agents from those that explicitly attempt to learn the value of joint actions and the strategies of their counterparts. We study (a simple form of) Q-learning in cooperative multiagent systems under these two perspectives, focusing on the influence of that game structure and exploration strategies on convergence to (optimal and suboptimal) Nash equilibria. We then propose alternative optimistic exploration strategies that increase the likelihood of convergence to an optimal equilibrium.

I survey the recent literature on the formation of networks. I provide definitions of network games, a number of examples of models from the literature, and discuss some of what is known about the (in)compatibility of overall societal welfare with individual incentives to form and sever links.

This paper presents on overview of the economics that lies behind social interaction models and briefly discusses the empirical approaches to social interactions. We present a simple model with local interactions, similar to Glaeser, Sacerdote and Scheinkman (1996) but using a continuous action space and starting with optimizing behavior. We then extend the model to include both global and local interactions. We suggest and use a methodology for using variation of intra-city aggregates to identify the relative sizes of local and global interactions. We also present a model with endogenous location choice and use the predictions of that model to identify the sources of cross-city variance that are due to sorting and interaction. Finally, we present a brief discussion of using time-series to estimate the social interactions in broad aggregates.

Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first four sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fifth section surveys the topological complications implied by non-mean-field-type social network structures in general. The next three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner’s Dilemma, the Rock–Scissors–Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.

A central idea in marketing and diffusion research is that influentials—a minority of individuals who influence an exceptional number of their peers—are important to the formation of public opinion. Here we examine this idea, which we call the “influentials hypothesis,” using a series of computer simulations of interpersonal influence processes. Under most conditions that we consider, we find that large cascades of influence are driven not by influentials, but by a critical mass of easily influenced individuals. Although our results do not exclude the possibility that influentials can be important, they suggest that the influentials hypothesis requires more careful specification and testing than it has received.

Abstract not found

The paper examines the behaviour of ‘‘evolutionary’ ’ models with ε-noise like those which have been used recently to discuss the evolution of social conventions. The paper is built around two main observations: that the ‘‘long run stochastic stability’ ’ of a convention is related to the speed with which evolution toward and away from the convention occurs, and that evolution is more rapid (and hence more powerful) when it may proceed via a series of small steps between intermediate steady states. The formal analysis uses two new measures, the radius and modified coradius, to characterize the long run stochastically stable set of an evolutionary model and to bound the speed with which evolutionary change occurs. Though not universally powerful, the result can be used to make many previous analyses more transparent and extends them by providing results on waiting times. A number of applications are also discussed. The selection of the risk dominant equilibrium in 2B2 games is generalized to the selection of 1 2-dominant equilibria in arbitrary games. Other applications involve two-dimensional local interaction and cycles as long run stochastically stable sets. 1.

This article argues that the agent-based computational model permits a distinctive approach to social science for which the term “generative ” is suitable. In defending this terminology, features distinguishing the approach from both “inductive ” and “deductive ” science are given. Then, the following specific contributions to social science are discussed: The agent-based computational model is a new tool for empirical research. It offers a natural environment for the study of connectionist phenomena in social science. Agent-based modeling provides a powerful way to address certain enduring—and especially interdisciplinary—questions. It allows one to subject certain core theories—such as neoclassical microeconomics—to important types of stress (e.g., the effect of evolving preferences). It permits one to study how rules of individual behavior give rise—or “map up”—to macroscopic regularities and organizations. In turn, one can employ laboratory behavioral research findings to select among competing agent-based (“bottom up”) models. The agent-based approach may well have the important effect of decoupling individual rationality from macroscopic equilibrium and of separating decision science from social science more generally. Agent-based modeling offers powerful new forms of hybrid theoretical-computational work; these are particularly relevant to the study of non-equilibrium systems. The agentbased approach invites the interpretation of society as a distributed computational device, and in turn the interpretation of social dynamics as a type of computation. This interpretation raises important foundational issues in social science—some related to intractability, and some to undecidability proper. Finally, since “emergence” figures prominently in this literature, I take up the connection between agent-based modeling and classical emergentism, criticizing the latter and arguing that the two are incompatible. � 1999 John Wiley &