Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference33 articles.
1. Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6), 25:1–25:22 (2008)
2. Albers, S.: On the value of coordination in network design. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’08, pp. 294–303. Society for Industrial and Applied Mathematics, Philadelphia (2008)
3. Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. In: SODA’07 (2007)
4. Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 295–304. IEEE Computer Society, Washington (2004)
5. Anshelevich, E., Dasgupta, A., Tardos, É., Wexler, T.: Near-optimal network design with selfish agents. In: STOC, pp. 511-520 (2003)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Intermodal Hinterland Network Design Games;Transportation Science;2020-09
2. Do Capacity Constraints Constrain Coalitions?;ACM Transactions on Economics and Computation;2016-11-03