Navigable networks as Nash equilibria of navigation games

@inproceedings{Gulys2015NavigableNA,
  title={Navigable networks as Nash equilibria of navigation games},
  author={Andr{\'a}s Guly{\'a}s and J{\'o}zsef J B{\'i}r{\'o} and Attila Kor{\"o}si and G{\'a}bor R{\'e}tv{\'a}ri and Dmitri Krioukov},
  booktitle={Nature communications},
  year={2015}
}
Common sense suggests that networks are not random mazes of purposeless connections, but that these connections are organized so that networks can perform their functions well. One function common to many networks is targeted transport or navigation. Here, using game theory, we show that minimalistic networks designed to maximize the navigation efficiency… CONTINUE READING

20 Figures & Tables

Topics

Statistics

01020201620172018
Citations per Year

Citation Velocity: 11

Averaging 11 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.