Computational Complexity of Computing a Quasi-Proper Equilibrium

Kristoffer Arnsfelt Hansen, Troels Bjerre Lund. Computational Complexity of Computing a Quasi-Proper Equilibrium. In Evripidis Bampis, Aris Pagourtzis, editors, Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings. Volume 12867 of Lecture Notes in Computer Science, pages 259-271, Springer, 2021. [doi]

Abstract

Abstract is missing.