Trembling hand perfection is NP-hard

Simple item page
dc.creatorMiltersen, Peter Bro
dc.date2008-12-02
dc.date.accessioned2026-07-07T12:08:37Z
dc.date.available2026-07-07T12:08:37Z
dc.descriptionIt 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.
dc.identifierhttps://arxiv.org/abs/0812.0492
dc.identifierhttp://arxiv.org/abs/0812.0492
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/209383
dc.subjectComputer Science and Game Theory
dc.titleTrembling hand perfection is NP-hard
dc.typetext

Files

Collections

arXiv