Author:
Alon Noga,Emek Yuval,Feldman Michal,Tennenholtz Moshe
Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. On the value of coordination in network design;Albers;SIAM J. Comput. (SICOMP),2009
2. N. Alon, Y. Azar, On-line Steiner trees in the Euclidean plane, in: Proc. of the 8th Symp. on Computational Geometry (SoCG), 1992, pp. 337–343.
3. N. Andelman, M. Feldman, Y. Mansour, Strong Price of Anarchy, in: Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2007.
4. The price of stability for network design with fair cost allocation;Anshelevich;SIAM J. Comput. (SICOMP),2008
5. Two-terminal routing games with unknown active players;Ashlagi;Artif. Intel. J.,2009
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Bayesian generalized network design;Theoretical Computer Science;2020-11
2. Bayesian Generalized Network Design;LEIBNIZ INT PR INFOR;2019
3. Bayesian Combinatorial Auctions;Journal of the ACM;2016-05-04