Using piecewise-constant congestion taxing policy in repeated routing games
From MaRDI portal
Publication:6566286
Recommendations
- In congestion games, taxes achieve optimal approximation
- Repeated congestion games with bounded rationality
- Online learning of Nash equilibria in congestion games
- Routing without regret: on convergence to Nash equilibria of regret-minimizing algorithms in routing games
- An improved tax scheme for selfish routing
This page was built for publication: Using piecewise-constant congestion taxing policy in repeated routing games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566286)