The Strong Price of Anarchy of Linear Bottleneck Congestion Games

2015-01-01

Theory of Computing Systems , Volume 57 - Issue 2 p. 377- 396

Additional Metadata
THEME	Logistics (theme 3)
Publisher	Springer
Persistent URL	dx.doi.org/10.1007/s00224-014-9598-9
Journal	Theory of Computing Systems
Grant	This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/612.001.352 - Combining Machine Learning and Game-theoretic Approaches for Cluster Analysis
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	de Keijzer, B, Schäfer, G, & Telelis, O. (2015). The Strong Price of Anarchy of Linear Bottleneck Congestion Games. Theory of Computing Systems, 57(2), 377–396. doi:10.1007/s00224-014-9598-9

See Also
article Inefficiency of Games with Social Context A. Anagnostopoulos (Aris), L. Becchetti, B. de Keijzer (Bart) and G. Schäfer (Guido)
article Inefficiency of Games with Social Context A. Anagnostopoulos (Aris), L. Becchetti, B. de Keijzer (Bart) and G. Schäfer (Guido)

Publication