A Bridge between Polynomial Optimization and Games with Imperfect Recall

25 Feb 2020 Gimbert Hugo Paul Soumyajit Srivathsan B.

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... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTER SCIENCE AND GAME THEORY
  • LOGIC IN COMPUTER SCIENCE