Computer Science – Computer Science and Game Theory
Scientific paper
2008-12-02
Computer Science
Computer Science and Game Theory
Scientific paper
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.
No associations
LandOfFree
Trembling hand perfection is NP-hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Trembling hand perfection is NP-hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Trembling hand perfection is NP-hard will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-718771