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.
Princeton University Press, 2003
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
In a coordination game with switching costs and logit quantal response, endogenous hard transformations (action deletion) eliminate inertia better than soft ones (taxes), while meta-level antagonistic social preferences can block individually Pareto-improving reforms.
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.
-
Why Efficient Reforms Fail: Endogenous Game Transformation under Status Quo Bias and Social Preferences
In a coordination game with switching costs and logit quantal response, endogenous hard transformations (action deletion) eliminate inertia better than soft ones (taxes), while meta-level antagonistic social preferences can block individually Pareto-improving reforms.