Communication networks and collective action
β Scribed by Phillip Bonacich
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 531 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0378-8733
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Network models of collective action commonly assume fixed social networks in which ties influence participation through social rewards. This implies that only certain ties are beneficial from the view of individual actors. Accordingly, in this study we allow that actors strategically revise their re
Motivated by implementing collective communication operations on workstation clusters, a problem of scheduling a dance party is formulated. The problem is solved by two algorithms based on searching and divide-and-conquer that generate suboptimal schedules and an algorithm based on graph factorizati
The collective communication process studied here involves the ability of users to request information from diverse sources (both in terms of locality and data type) and receive this information before the users' deadlines expire. A model has been developed and examined for the case when the network