On the performance of user equilibria in traffic networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the performance of user equilibria in traffic networks

Full text

Pdf (196 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms table of contents

Baltimore, Maryland

SESSION: Session 1C table of contents

Pages: 86 - 87

Year of Publication: 2003

ISBN:0-89871-538-5

Authors

Andreas S. Schulz	M.I.T., Cambridge, MA
Nicolás Stier Moses	M.I.T., Cambridge, MA

Sponsors

: SIAM Activity Group on Discrete Mathematics
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 48, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

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	Jahn, O., R. Möhring, and A. Schulz (2000). Optimal routing of traffic flows with length restrictions in networks with congestion. In Operations Research Proceedings 1999, pp. 437--442. Springer.
	2	Murchland, J. (1970). Braess's paradox of traffic flow. Transportation Research 4, 391--394.
	3	Tim Roughgarden, The price of anarchy is independent of the network topology, Journal of Computer and System Sciences, v.67 n.2, p.341-364, September 2003 [doi>10.1016/S0022-0000(03)00044-8]
	4	Tim Roughgarden , Éva Tardos, How bad is selfish routing?, Journal of the ACM (JACM), v.49 n.2, p.236-259, March 2002 [doi>10.1145/506147.506153]
	5	Wardrop, J. (1952). Some theoretical aspects of road traffic research. In Proceedings of the Institution of Civil Engineers, Volume 1, pp. 325--378.

CITED BY 7

	Elliot Anshelevich , Anirban Dasgupta , Eva Tardos , Tom Wexler, Near-optimal network design with selfish agents, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA
	Tim Roughgarden, The price of anarchy is independent of the network topology, Journal of Computer and System Sciences, v.67 n.2, p.341-364, September 2003
	Chandra Chekuri , Julia Chuzhoy , Liane Lewin-Eytan , Joseph (Seffi) Naor , Ariel Orda, Non-cooperative multicast and facility location games, Proceedings of the 7th ACM conference on Electronic commerce, p.72-81, June 11-15, 2006, Ann Arbor, Michigan, USA
	Ho-Lin Chen , Tim Roughgarden, Network design with weighted players, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, July 30-August 02, 2006, Cambridge, Massachusetts, USA
	Olaf Jahn , Rolf H. Möhring , Andreas S. Schulz , Nicolás E. Stier-Moses, System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion, Operations Research, v.53 n.4, p.600-616, July-August 2005
	Stefano Leonardi , Piotr Sankowski, Network formation games with local coalitions, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, August 12-15, 2007, Portland, Oregon, USA
	Jian Li, An O( lognloglogn) upper bound on the price of stability for undirected Shapley network design games, Information Processing Letters, v.109 n.15, p.876-878, July, 2009