we address a question in graphs called the stable paths problem, which is an abstraction of a network routing problem concerning the border gateway protocol (bgp). the main tool we use is scarf's lemma, an important result from game theory. this talk will describe scarf's lemma and how it is related to other results more familiar to combinatorialists, and then will explain its implications for the stable paths problem.