Publisher
Springer International Publishing
Reference24 articles.
1. Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6), 1–22 (2008)
2. Lecture Notes in Computer Science;H Angelidakis,2013
3. Beier, R., Czumaj, A., Krysta, P., Vöcking, B.: Computing equilibria for congestion games with (im)perfect information. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 746–755. Citeseer (2004)
4. Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure nash equilibria. In: Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, pp. 604–612 (2004)
5. Lecture Notes in Computer Science;M Gairing,2009
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献