Abstract
The collective coordination of distributed tasks in a complex system can be represented as decision dynamics on a graph. This abstract representation allows studying the performance of local decision heuristics as a function of task complexity and network architecture. Here, we identify hard-to-solve and easy-to-solve networks in a social differentiation task within the basic model of small-world graphs. We show that, depending on the details of the decision heuristic as well as the length of the added links, shortcuts can serve as structural promotors, which speed up convergence toward a solution, but also as structural insulators, which make the network more difficult to solve. Our findings have implications for situations where, in distributed decision systems, regional solutions emerge, which are globally incompatible as, for example, during the emergence of technological standards.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
