When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners

Ivan Geffner, Erez Karpas, Moshe Tennenholtz

The inefficiency of selfish routing in congested networks is a classical problem in algorithmic game theory, often captured by the Price of Anarchy (i.e., the ratio between the soc…