Dresden 2017 – scientific programme

Parts | Days | Selection | Search | Updates | Downloads | Help

BP: Fachverband Biologische Physik

BP 50: Networks: From Topology to Dynamics I (Joint Session SOE/DY/BP)

BP 50.7: Talk

Thursday, March 23, 2017, 11:30–11:45, GÖR 226

Collective navigation of complex networks: Participatory greedy routing — •Kaj-Kolja Kleineberg and Dirk Helbing — Computational Social Science, ETH Zurich, Clausiusstrasse 50, CH-8092 Zurich, Switzerland

Many networks are used to transfer information or goods, in other words, they are navigated. The larger the network, the more difficult it is to navigate efficiently. Indeed, information routing in the Internet faces serious scalability problems due to its rapid growth, recently accelerated by the rise of the Internet of Things. Large networks like the Internet can be navigated efficiently if nodes, or agents, actively forward information based on hidden maps underlying these systems. However, in reality most agents will deny to forward messages, which has a cost, and navigation is impossible. Can we design appropriate incentives that lead to participation and global navigability? Here, we present an evolutionary game where agents share the value generated by successful delivery of information or goods. We show that global navigability can emerge, but its complete breakdown is possible as well. Furthermore, we show that the system tends to self-organize into local clusters of agents who participate in the navigation. This organizational principle can be exploited to favor the emergence of global navigability in the system.