We study a connections model where the strength of a link depends on the amount invested in it and is determined by an increasing strictly concave function. The revenue from investments in links is the information that the nodes receive through the network. First, the structures of efficient...

We analyze a team formation process that generalizes matching models and network formation models, allowing for overlapping teams of heterogeneous size. We apply different notions of stability: myopic team-wise stability, which extends to our setup the concept of pair-wise stability, coalitional...

This paper studies the connections model (Jackson and Wolinsky, 1996) when nodes may have different values. It is shown that efficiency is reached by a strongly hierarchical structure that we call strong NSG-networks: Nested Split Graph networks where the hierarchy or ranking of nodes inherent...

This paper brings together analyses of 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 Nash...

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

The paper of Charoensook ((2015), [3]) extends the results of the original model of two-way flow information sharing network of Bala and Goyal ((2000),[1]), given that a condition called Uniform Partner Ranking is satisfied. In this technical note, we study what happen to these results when...

This paper develops a theoretical model of cyberwarfare between nations, focusing on the factors that determine the severity and outcomes of cyber conflicts. We introduce a two-country model where nations invest in offensive or defensive cyber capabilities across networked systems. We show that...

This paper introduces the choice of identity characteristics, and, commitments to these characteristics, in a network formation model where links costs are shared. Players want to link to the largest group given that linking costs are decreasing (increasing) in commitments for same (different)...

We study a coordination problem where agents act sequentially. Agents are embedded in an observation network that allows them to observe the actions of their neighbors. We find that coordination failures do not occur if there exists a sufficiently large clique. Its existence is necessary and...