Funder
University of Cyprus
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference20 articles.
1. Abbott, T.G., Kane, D.M., Valiant, P.: On the complexity of two-player win-lose games. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 113–122 (2005)
2. Avriel, M., Diewert, W.E., Schaible, S., Zang, I.: Generalized Concavity, SIAM edition in Series. Classics in Applied Mathematics (2010)
3. Bilò, V., Mavronicolas, M.: The complexity of computational problems about Nash equilibria in symmetric win-lose games. Algorithmica 7615(2), 447–530 (2021)
4. Chen, X., Deng, X., Teng, S.-H.: Sparse games are hard. In: Proceedings of the 2nd International Workshop on Internet and Network Economics, Lecture Notes in Computer Science, vol. 4286, pp. 262–273. Springer (2006)
5. Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56(3) (2009)