Many social networks have the following properties: (i) a short average distance between any two individuals; (ii) a high clustering coefficient; (iii) segregation patterns; the presence of (iv) brokers and (v) hubs. (i) and (ii) define a small world network. This paper develops a strategic...

In this note, I study the roles of value heterogeneity - i.e., agents are heterogeneous in terms of values of nonrival information thay they possessed - in determining the shapes of two-way flow Strict Nash networks when small amount of decay is present. I do so by extending the two-way flow...

We consider a standard coalitional bargaining game where once a coalition forms it exits as in Okada (2011), however, instead of alternating offers, we have simultaneous payoff demands. We focus in the producer game he studies. Each player is chosen with equal probability. If that is the case,...

This paper brings together analyses of two-way flow Strict Nash networks under exclusive player heterogeneity assumption and exclusive partner heterogeneity assumption. This is achieved through examining how the interactions between these two assumptions influence important properties of Strict...

We examine patterns of acquiring non-native languages in a model with two languages and two populations with heterogeneous learning skills, where every individual faces a binary choice of learning the foreign language or refraining from doing so. We show that both interior and corner linguistic...

This paper studies a non-cooperative model of network formation. Built upon the two-way flow model of Bala and Goyal (2000a), it assumes that information decay as it flows through each agent, and the decay is increasing and concave in the number of his links. This assumption results in the fact...

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...

We study two n-player sequential network formation games with externalities. Link formation is tied to simultaneous transfer selection in a Nash demand like game in each period. Players in groups can counterpropose. We give necessary and sufficient conditions for efficiency in terms of cyclical...

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 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...