The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game
Year of publication: |
2021
|
---|---|
Authors: | Etessami, Kousha |
Published in: |
Games and economic behavior. - Amsterdam : Elsevier, ISSN 0899-8256, ZDB-ID 1002944-8. - Vol. 125.2021, p. 107-140
|
Subject: | Algorithms | Computational complexity | Extensive form game | Perfect equilibrium | Quasi-perfect equilibrium | Extensives Spiel | Spieltheorie | Game theory | Gleichgewichtstheorie | Equilibrium theory | Nash-Gleichgewicht | Nash equilibrium | Gleichgewichtsmodell | Equilibrium model |
-
Chapter 45 Computing equilibria for two-person games
Von Stengel, Bernhard, (2002)
-
Backward induction in games without perfect recall
Hillas, John, (2020)
-
On the equivalence between (quasi-)perfect and sequential equilibria
Pimienta, Carlos, (2014)
- More ...
-
Kozen, Dexter, (2000)
-
Etessami, Kousha, (2020)
- More ...