A belief game construction plus TB-DAG representation converts imperfect-recall and team zero-sum games into solvable perfect-recall forms, with proven complexity bounds and state-of-the-art benchmark performance.
Tight lower bounds for certain parameterized NP-hard problems.Information and Computation, 201(2): 216–231, 2005
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient representations for team and imperfect-recall equilibrium computation
A belief game construction plus TB-DAG representation converts imperfect-recall and team zero-sum games into solvable perfect-recall forms, with proven complexity bounds and state-of-the-art benchmark performance.