1. Chen, X. and Deng, X. (2006), “Settling the complexity of two‐player Nash equilibrium”,Proceedings of the 47th IEEE Symposium on Found of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, USA, pp. 261‐72.
2. Conitzer, V. and Sandholm, T. (2007), “Incremental mechanism design”,Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, 6‐12 January, pp. 1251‐6.
3. Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-coding
4. Gottlob, G., Greco, G. and Mancini, T. (2007), “Complexity of pure equilibria in Bayesian games”, in Veloso, M.M. (Ed.),Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, 6‐12 January, pp. 1294‐9.
5. Guerin, F. (2006a), “An algorithmic approach to specifying and verifying subgame perfect equilibria”,Proceedings of the 8th Workshop on Game Theoretic and Decision Theoretic Agents (GTDT‐2006), Hakodate, Japan, AAMAS.