2000 character limit reached
Trembling hand perfection is NP-hard (0812.0492v1)
Published 2 Dec 2008 in cs.GT
Abstract: It is NP-hard to decide if a given pure-strategy Nash equilibrium of a given three-player game in strategic form with integer payoffs is trembling hand perfect.