We culminate the extension of the results on efficiency in the seminal connections model of Jackson and Wolinsky (1996), partially addressed in previous papers. In a model where both nodes and links are heterogeneous, we prove that efficiency is reached by networks with a particular type of...

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

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 deals with electing candidates. In elections voters are frequently offered a small set of actions (voting in favor of one candidate, voting blank, spoiling the ballot, and not showing up). Thus voters can express neither a negative opinion nor an opinion on more than one candidate....