1. Basu, K., Weibull, J.W.: Strategy subsets closed under rational behavior. Econ. Lett. 36(2), 141–146 (1991)
2. Benisch, M., Davis, G.B., Sandholm, T.: Algorithms for rationalizability and CURB sets. In: Proceedings of the Twenty-First National Conference on Artificial Intelligence, pp. 598–604. AAAI Press (2006)
3. Bilò, V., Mavronicolas, M.: A catalog of
∃
ℝ
${\exists {\mathbb {R}}}$
-complete decision problems about Nash equilibria in multi-player games. In: Ollinger, N., Vollmer, H. (eds.) STACS 2016, LIPIcs, vol. 47, pp. 17:1–17:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)
4. Blömer, J.: Computing sums of radicals in polynomial time. In: 32Nd Annual Symposium on Foundations of Computer Science (FOCS 1991), pp. 670–677. IEEE Computer Society Press (1991)
5. Borgs, C., Chayes, J., Immorlica, N., Kalai, A.T., Mirrokni, V., Papadimitriou, C.: The myth of the folk theorem. Games and Economic Behavior 70(1), 34–43 (2010)