ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
A stronger bound on Braess's Paradox
Full text PdfPdf (161 KB)
Source Symposium on Discrete Algorithms archive
Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms table of contents
New Orleans, Louisiana
SESSION: Session 4B table of contents
Pages: 340 - 341  
Year of Publication: 2004
ISBN:0-89871-558-X
Authors
Henry Lin  University of California at Berkeley, Berkeley, CA
Tim Roughgarden  University of California at Berkeley, Berkeley, CA
Éva Tardos  Cornell University, Ithaca, NY
Sponsor
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
Society for Industrial and Applied Mathematics  Philadelphia, PA, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 30,   Citation Count: 4
Additional Information:

references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
D. Braess. Uber ein paradoxon der verkehrsplanung. Unternehmensforschung, 12:258--268, 1968.
 
2
M. A. Hall. Properties of the equilibrium state in transportation networks. Transportation Science, 12(3):208--216, 1978.
 
3
T. Roughgarden, Designing Networks for Selfish Users is Hard, Proceedings of the 42nd IEEE symposium on Foundations of Computer Science, p.472, October 14-17, 2001

CITED BY  4
Richard Cole , Yevgeniy Dodis , Tim Roughgarden, How much can taxes help selfish routing?, Journal of Computer and System Sciences, v.72 n.3, p.444-467, May 2006
Tim Roughgarden, On the severity of Braess's paradox: designing networks for selfish users is hard, Journal of Computer and System Sciences, v.72 n.5, p.922-953, August 2006
Greg Valiant , Tim Roughgarden, Braess's paradox in large random graphs, Proceedings of the 7th ACM conference on Electronic commerce, p.296-305, June 11-15, 2006, Ann Arbor, Michigan, USA
A. C. Kaporis , P. G. Spirakis, The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions, Theoretical Computer Science, v.410 n.8-10, p.745-755, March, 2009
Collaborative Colleagues:
Henry Lin: colleagues
Tim Roughgarden: colleagues
Éva Tardos: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player