Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. Exact price of anarchy for polynomial congestion games;Aland;SIAM J. Comput.,2011
2. Inefficiency of games with social context;Anagnostopoulos;Theory Comput. Syst.,2015
3. The price of routing unsplittable flow;Awerbuch;SIAM J. Comput.,2013
4. Data-driven models of selfish routing: why price of anarchy does depend on network topology;Benita,2020
5. Weighted congestion games: price of anarchy, universal worst-case examples, and tightness;Bhawalkar;ACM Trans. Econ. Comput.,2014
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献