Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing
In this paper we study the model of nonatomic selfish routing and characterize the topologies of undirected/directed networks in which every Nash equilibrium is weakly Pareto optimal, meaning that no deviation of all players could make everybody better off. In particular, we first obtain the characterizations for single-commodity case by applying relatively standard graphical arguments, and then the counterpart for two-commodity undirected case by introducing some new algorithmic ideas and reduction techniques.
KeywordsNonatomic selfish routing Weakly Pareto optimal Single-commodity networks Multi-commodity networks Extension-parallel networks
- 1.Beckmann, M.J., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)Google Scholar