PoA

Finds the Price of Anarchy for Routing Games

CRAN Package

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.

  • Version1.2.1
  • R versionunknown
  • LicenseGPL-2
  • Needs compilation?No
  • Last release03/18/2019

Team


Insights

This package has been downloaded 110 times in the last 30 days. The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 5 times.

Data provided by cranlogs


Binaries


Dependencies

  • Imports5 packages