Author:
Bonifaci Vincenzo,Iorio Ugo Di,Laura Luigi
Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. T. Abbott, D. Kane, P. Valiant, On the complexity of two-player win–lose games, in: Proc. 46th Symp. on Foundations of Computer Science, 2005, pp. 113–122
2. A polynomial time algorithm for finding Nash equilibria in planar win–lose games;Addario-Berry;Journal of Graph Algorithms and Applications,2007
3. V. Bonifaci, U.D. Iorio, L. Laura, New results on the complexity of uniformly mixed Nash equilibria, in: Proc. 1st Workshop on Internet and Network Economics, 2005, pp. 1023–1032
4. V. Bonifaci, U.D. Iorio, L. Laura, On the complexity of uniformly mixed Nash equilibria and related regular subgraph problems, in: Proc. 15th Symp. on Fundamentals of Computation Theory, 2005, pp. 197–208
5. Maximum k-regular induced subgraphs;Cardoso;Journal of Combinatorial Optimization,2007
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献