Семинар МЛ ТИ: Kristoffer Arnsfelt Hansen "Computational Complexity of Computing Nash Equilibrium Refinements"

15 января на семинаре лаборатории теоретической информатики состоится доклад  Кристофера Арнсфельта Хансена  "Computational Complexity of Computing Nash Equilibrium Refinements". 

Abstract: The motivation for introducing Nash equilibrium refinements is to eliminate undesirable equilibria, e.g., those relying on playing dominated strategies.  From a computational perspective the interesting question is whether imposing such restrictions incur a significant additional computational cost. We answer this question for a range of different equilibrium refinements.