Finds the Price of Anarchy for Routing Games

Computes the optimal flow, Nash flow and the Price of Anarchy for any routing game defined within the game theoretical framework. The input is a routing game in the form of it’s cost and flow functions. Then transforms this into an optimisation problem, allowing both Nash and Optimal flows to be solved by nonlinear optimisation. See <> and Knight and Harper (2013) for more information.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.2.1 by Hector Haffenden, a year ago

Browse source code at

Authors: Hector Haffenden

Documentation:   PDF Manual  

GPL-2 license

Imports stats, dplyr, tibble, pracma, nloptr

See at CRAN