- On the Hardness of Network Design for Bottleneck Routing GamesDimitris Fotakis; Alexis C. Kaporis; Thanasis Lianeas; Paul G. SpirakisAlgorithmic Game Theory, Springer Berlin Heidelberg, 156-167, 2012.
- Congestion Games with Capacitated ResourcesLaurent Gourvès; Jérôme Monnot; Stefano Moretti; Nguyen Kim ThangAlgorithmic Game Theory, Springer Berlin Heidelberg, 204-215, 2012.
- Routing Games in the many players regimeEitan Altman; Richard Combes; Zwi Altman; Sylvain SorinProceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools, 2012.
书籍章节
Capacitated Network Design Games
6阅读
