We study social learning in a social network setting where agents receive independent noisy signals about the truth. Agents naïvely update beliefs by repeatedly taking weighted averages of neighbors' opinions. The weights are fixed in the sense of representing average frequency and intensity of...

This paper is concerned with the asymptotic behavior of some global quantities relating to weighted decision rules when the number of small voters tends to infinity. First, voting is assumed to be motivated by interests, so that the collective decision is 'preference aggregation'. Here the...

Feld, Grofman and Ray (2003) offer a bargaining model for weighted voting games that is a close relative of the nucleolus and the kernel. They look for a set of weights that preserves winning coalitions that has the property of minimizing the difference between the weight of the smallest and the...

The novelty of our model is to combine models of collective action on networks with models of social learning. Agents are connected according to an undirected graph, the social network, and have the choice between two actions: either to adopt a new behavior or technology or stay with the default...