Author:
Spirakis Paul G.,Panagopoulou Panagiota N.
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Lecture Notes in Computer Science;V. Bilò,2008
2. Chen, X., Xiaotie, D.: Settling the complexity of two-player Nash equilibrium. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 261–272 (2006)
3. Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 169–178 (2007)
4. Díaz, J., Goldberg, L.A., Mertzios, G.B., Richerby, D., Serna, M.J., Spirakis, P.G.: Approximating fixation probabilities in the generalized Moran process. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 954–960 (2012)
5. Feige, U., Kilian, J.: Zero knowledge and the chromatic number. J. Comput. System Sci. 57(2), 187–199 (1998)