Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference26 articles.
1. Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. J. ACM (2008). https://doi.org/10.1145/1455248.1455249
2. Albers, S., Lenzner, P.: On approximate Nash equilibria in network design. Internet Math. 9(4), 384–405 (2013)
3. Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602–1623 (2008)
4. Bilò, V., Flammini, M., Monaco, G., Moscardelli, L.: Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions. In: Proceedings of the 11th Workshop on Internet and Network Economics (WINE), pp. 118–131 (2015)
5. Caragiannis, I., Fanelli, A.: On approximate pure Nash equilibria in weighted congestion games with polynomial latencies. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 133:1–133:12 (2019)