The complexity of game isomorphism
Theoretical Computer Science
Pure strategy Nash equilibria and the probabilistic prospects of Stackelberg players
Operations Research Letters
On the complexity of game isomorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |