A stronger bound on Braess s Paradox

Henry Lin, Tim Roughgarden, Éva Tardos. A stronger bound on Braess s Paradox. In J. Ian Munro, editor, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004. pages 340-341, SIAM, 2004. [doi]

@inproceedings{LinRT04,
  title = {A stronger bound on Braess s Paradox},
  author = {Henry Lin and Tim Roughgarden and Éva Tardos},
  year = {2004},
  doi = {10.1145/982792.982840},
  url = {http://doi.acm.org/10.1145/982792.982840},
  researchr = {https://researchr.org/publication/LinRT04},
  cites = {0},
  citedby = {0},
  pages = {340-341},
  booktitle = {Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004},
  editor = {J. Ian Munro},
  publisher = {SIAM},
}