Computational Complexity of Computing a QuasiProper Equilibrium
Abstract
We study the computational complexity of computing or approximating a quasiproper equilibrium for a given finite extensive form game of perfect recall. We show that the task of computing a symbolic quasiproper equilibrium is $\mathrm{PPAD}$complete for twoplayer games. For the case of zerosum games we obtain a polynomial time algorithm based on Linear Programming. For general $n$player games we show that computing an approximation of a quasiproper equilibrium is $\mathrm{FIXP}_a$complete.
 Publication:

arXiv eprints
 Pub Date:
 July 2021
 arXiv:
 arXiv:2107.04300
 Bibcode:
 2021arXiv210704300A
 Keywords:

 Computer Science  Computer Science and Game Theory;
 Computer Science  Computational Complexity
 EPrint:
 Full version of paper to appear at the 23rd International Symposium on Fundamentals of Computation Theory (FCT 2021)