Trembling hand perfection is NP-hard
classification
💻 cs.GT
keywords
givenhandnp-hardtremblingdecideequilibriumformgame
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.