The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games

We show that for several solution concepts for finite n -player games, where n ≥ 3, the task of simply verifying its conditions is computationally equivalent to the decision problem of the existential theory of the reals. This holds for trembling hand perfect equilibrium, proper equilibrium, and CUR...

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 63; no. 7; pp. 1554 - 1571
Main Author:	Hansen, Kristoffer Arnsfelt
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2019 Springer Nature B.V
Subjects:	Completeness Complexity Computer Science Decision theory Equilibrium Equivalence Game theory Special Issue on Algorithmic Game Theory (SAGT 2017) Theory of Computation Minmax value Existential theory of the reals Nash equilibrium refinements Computational complexity
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!