The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing
Lists
Only you see this
Abstract
This paper provides new bounds on the quality of equilibria in finite congestion games with affine cost functions, specifically for atomic network routing games. It is well known that the price of ...
BibTeX
@article{correa2019inefficiency,
author = {José Correa and Jasper de Jong and Bart de Keijzer and Marc Uetz},
title = {{The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing}},
journal = {Math. Oper. Res.},
year = {2019},
doi = {10.1287/moor.2018.0968},
}Loading related content...