Traveling among the vertices in a graph is a fundamental problem in discrete mathematics. What if many entities traveling simultaneously in a graph made their own decisions? First, we formalize one way entities in a shared network might make decisions. Second, we compare decentralized decision making strategy to modern applications like computer networking, transportation and TODO.