The computational complexity of finding a mixed Berge equilibrium for a k-person noncooperative game in normal form
Year of publication: |
2018
|
---|---|
Authors: | Nahhas, Ahmad ; Corley, H. W. |
Published in: |
International game theory review. - [River Edge], NJ [u.a.] : World Scientific, ISSN 0219-1989, ZDB-ID 1500913-0. - Vol. 20.2018, 4, p. 1-13
|
Subject: | Mixed Berge equilibrium | computational complexity | NP-complete | Spieltheorie | Game theory | Nash-Gleichgewicht | Nash equilibrium | Nichtkooperatives Spiel | Noncooperative game |
-
Zahoransky, Valeria, (2022)
-
The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game
Etessami, Kousha, (2021)
-
Chapter 14. The Complexity of Computing Equilibria
Papadimitriou, Christos, (2015)
- More ...
-
Nahhas, Ahmad, (2018)
-
Nahhas, Ahmad, (2017)
-
The mixed Berge equilibrium in extensive form games
Nahhas, Ahmad, (2017)
- More ...