Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference23 articles.
1. Apt, K.R.: Order independence and rationalizability. In: Theoretical Aspects of Rationality and Knowledge (TARK X) (2005). arXiv: cs/0509063
2. Beame, P., Cook, S., Edmonds, J., Impagliazzo, R., Pitassi, T.: The relative complexity of NP search problems. J. Comput. Syst. Sci. 57, 3–19 (1998)
3. Bernheim, B.D.: Rationalizable strategic behavior. Econometrica 52, 1007–1028 (1984)
4. Brandt, F., Brill, M., Fischer, F., Harrenstein, P.: On the complexity of iterated weak dominance in constant-sum games. Theory of Computing Systems 49 (1), 162–181 (2011). doi: 10.1007/s00224-010-9282-7
5. de Callataÿ, A.: Natural and Artificial Intelligence, 2nd edn. North-Holland (1992)