A Bridge between Polynomial Optimization and Games with Imperfect Recall
We provide several positive and negative complexity results for solving games with imperfect recall. Using a one-to-one correspondence between these games on one side and multivariate polynomials on the other side, we show that solving games with imperfect recall is as hard as solving certain problems of the first order theory of reals. We establish square root sum hardness even for the specific class of A-loss games. On the positive side, we find restrictions on games and strategies motivated by Bridge bidding that give polynomial-time complexity.
PDF AbstractCategories
Computer Science and Game Theory
Logic in Computer Science
Datasets
Add Datasets
introduced or used in this paper
