PoA
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 <https://en.wikipedia.org/wiki/Congestion_game> and Knight and Harper (2013) <doi:10.1016/j.ejor.2013.04.003> for more information.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.2.1 |
rolling linux/jammy R-4.5 | PoA_1.2.1.tar.gz |
17.1 KiB |
1.2.1 |
rolling linux/noble R-4.5 | PoA_1.2.1.tar.gz |
17.0 KiB |
1.2.1 |
rolling source/ R- | PoA_1.2.1.tar.gz |
2.7 KiB |
1.2.1 |
latest linux/jammy R-4.5 | PoA_1.2.1.tar.gz |
17.1 KiB |
1.2.1 |
latest linux/noble R-4.5 | PoA_1.2.1.tar.gz |
17.0 KiB |
1.2.1 |
latest source/ R- | PoA_1.2.1.tar.gz |
2.7 KiB |
1.2.1 |
2026-04-26 source/ R- | PoA_1.2.1.tar.gz |
2.7 KiB |
1.2.1 |
2026-04-23 source/ R- | PoA_1.2.1.tar.gz |
2.7 KiB |
1.2.1 |
2026-04-09 windows/windows R-4.5 | PoA_1.2.1.zip |
19.6 KiB |
1.2.1 |
2025-04-20 source/ R- | PoA_1.2.1.tar.gz |
2.7 KiB |