In classical facility location, a central authority places facilities, e.g., hospitals to serve a set of clients optimally. In practice, however, these are usually placed by selfish companies that want to make a profit. This produces inefficiencies, which we want to investigate. So far, we built a model of competitive facility location  which models clients that want to avoid congestion (i.e., waiting times) at their chosen facility. This model, however, completely ignores the traveling time to the facility, which of course also depends on the congestion of the used links. Therefore, we want to integrate our facility location model with the selfish routing game by Roughgarden and Tardos , which models traffic participants optimizing their traveling times in a congested network. This might result in a model similar to the one visualized below.