Author:
Fischer Simon,Vöcking Berthold
Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. Worst-case equilibria;Koutsoupias,1999
2. A. Czumaj, B. Vöcking, Tight bounds for worst-case equilibria, in: Proc. 13th Ann. ACM–SIAM Symp. on Discrete Algorithms, SODA, 2002, pp. 413–420
3. Approximate equilibria and ball fusion;Koutsoupias;Theory Comput. Syst.,2003
4. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, P. Spirakis, The structure and complexity of Nash equilibria for a selfish routing game, in: Proc. 29th Int. EATCS Coll. on Automata, Languages and Programming, ICALP, Malaga, Spain, 2002, pp. 123–134
5. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien, Computing Nash equilibria for scheduling on restricted parallel links, in: Proc. 36th Ann. ACM. Symp. on Theory of Comput., STOC, 2004, pp. 613–622
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Which is the Worst-Case Nash Equilibrium?;SIAM Journal on Discrete Mathematics;2024-06-05
2. Price of Anarchy for Machines Models;Encyclopedia of Algorithms;2016
3. Price of Anarchy for Machines Models;Encyclopedia of Algorithms;2014
4. Selfish bin coloring;Journal of Combinatorial Optimization;2010-02-18
5. How hard is it to find extreme Nash equilibria in network congestion games?;Theoretical Computer Science;2009-11