Social media are becoming increasingly important in our society and change the way people communicate, how they acquire information, and how they form beliefs. Experts are concerned that the rise of social media may make interaction and information exchange among like-minded individuals more...

In this paper, we show that a concept of aggregation can hold in network games. Breaking up large networks into smaller pieces, which can be replaced by representative players, leads to a coarse-grained description of strategic interactions. This method of summarizing complex strategic...

Bi and branching networks are two classes of minimal networks often found in the literatures of two-way flow Strict Nash networks. Why so? In this paper, we answer this question by establishing a generalized condition that holds together many models in the literature, and then show that this...

A network payoff function assigns a utility to all participants in a (social) network. In this paper we discuss properties of such network payoff functions that guarantee the existence of certain types of pairwise stable networks and the convergence of certain network formation processes. In...

This paper addresses the existence of Nash equilibria in one-way flow or directed network models in a number of different settings. In these models players form costly links with other players and obtain resources from them through the directed path connecting them. We find that heterogeneity in...

Conflict parties are frequently involved into more than one conflict at a given time. In this paper the interrelated structure of conflictive relations is modeled as a conflict network where opponents are embedded in a local structure of bilateral conflicts. Conflict parties invest in specific...

This paper reports the results of a laboratory experiment on network formation among heterogeneous agents. The experimental design extends the basic Bala-Goyal (2000) model of network formation with decay and two-way flow of benefits by allowing for agents with lower linking costs or higher...

Delayed perfect monitoring in an infinitely repeated discounted game is modelled by allocating the players to a connected and undirected network. Players observe their immediate neighbors' behavior only, but communicate over time the repeated game's history truthfully throughout the network. The...

A tragedy of the commons appears when the users of a common resource have incentives to exploit it more than the socially efficient level. We analyze the situation when the tragedy of the commons is embedded in a network of users and sources. Users play a game of extractions, where they decide...