E. Allender, D. A. Mix-barrington, T. Chakraborty, S. Datta, and S. Roy, Grid Graph Reachability Problems, 21st Annual IEEE Conference on Computational Complexity (CCC'06), pp.299-313, 2006.
DOI : 10.1109/CCC.2006.22

K. R. Apt, Uniform Proofs of Order Independence for Various Strategy Elimination Procedures, Contributions in Theoretical Economics, vol.4, issue.1, 2004.
DOI : 10.2202/1534-5971.1141

A. Brandenburger, A. Friedenberg, and H. J. Keisler, Admissibility in Games, Econometrica, vol.76, issue.2, pp.307-352, 2008.
DOI : 10.1111/j.1468-0262.2008.00835.x

F. Brandt, M. Brill, F. Fischer, and P. Harrenstein, On the Complexity of Iterated Weak Dominance in Constant-Sum Games, Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT), pp.287-298, 2009.
DOI : 10.1007/978-3-642-04645-2_26

F. Brandt, F. Fischer, and M. Holzer, Symmetries and the complexity of pure Nash equilibrium, Journal of Computer and System Sciences, vol.75, issue.3, pp.163-177, 2009.
DOI : 10.1016/j.jcss.2008.09.001

V. Conitzer and T. Sandholm, Complexity of (iterated) dominance, Proceedings of the 6th ACM conference on Electronic commerce , EC '05, pp.88-97, 2005.
DOI : 10.1145/1064009.1064019

C. Daskalakis and C. H. Papadimitriou, Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 2008.
DOI : 10.1109/FOCS.2008.84

K. Ellul, B. Krawetz, J. Shallit, and M. Wang, Regular expressions: New results and open problems, Journal of Automata, Languages and Combinatorics, vol.9, pp.2-3233, 2004.

H. N. Gabow, S. N. Maheshwari, and L. Osterweil, On Two Problems in the Generation of Program Test Paths, IEEE Transactions on Software Engineering, vol.2, issue.3, pp.227-231, 1976.
DOI : 10.1109/TSE.1976.233819

I. Gilboa, E. Kalai, and E. Zemel, The Complexity of Eliminating Dominated Strategies, Mathematics of Operations Research, vol.18, issue.3, pp.553-565, 1993.
DOI : 10.1287/moor.18.3.553
URL : https://hal.archives-ouvertes.fr/hal-00481372

F. Glover, Maximum matching in a convex bipartite graph, Naval Research Logistics Quarterly, vol.14, issue.3, pp.313-316, 1967.
DOI : 10.1002/nav.3800140304

R. Greenlaw, H. J. Hoover, and W. L. Ruzzo, Limits to Parallel Computation, 1995.

D. E. Knuth, C. H. Papadimitriou, and J. N. Tsitsiklis, A note on strategy elimination in bimatrix games, Operations Research Letters, vol.7, issue.3, pp.103-107, 1988.
DOI : 10.1016/0167-6377(88)90075-2

H. Moulin, Dominance Solvable Voting Schemes, Econometrica, vol.47, issue.6, pp.1337-1351, 1979.
DOI : 10.2307/1914004

R. B. Myerson, Game Theory: Analysis of Conflict, 1991.

C. H. Papadimitriou and T. Roughgarden, Computing equilibria in multi-player games, Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.82-91, 2005.

I. Parberry, On the computational complexity of optimal sorting network verification, Proceedings of the Conference on Parallel Architectures and Languages Europe (PARLE), pp.252-269, 1991.
DOI : 10.1007/BFb0035109

R. Parikh, On Context-Free Languages, Journal of the ACM, vol.13, issue.4, pp.570-581, 1966.
DOI : 10.1145/321356.321364

L. Samuelson, Dominated strategies and common knowledge, Games and Economic Behavior, vol.4, issue.2, pp.284-313, 1992.
DOI : 10.1016/0899-8256(92)90020-S