Trembling hand perfection is NP-hard

Miltersen, Peter Bro

Trembling hand perfection is NP-hard

Authors

Description

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.

Keywords

Computer Science and Game Theory

URI

http://salesiana.dossiersoluciones.com/handle/123456789/209383

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0812.0492
http://arxiv.org/abs/0812.0492

Collections

arXiv

Full item page

Trembling hand perfection is NP-hard

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Keywords

Citation

URI

Consulte el texto completo en el siguiente enlace:

Collections