On the Hardness of Finding Symmetries in Markov Decision Processes

In this work we address the question of finding symmetries of a given MDP. We show that the problem is Isomorphism Complete, that is, the problem is polynomially equivalent to verifying whether two gr