Weihrauch degrees of finding equilibria in sequential games
Logic in Computer Science
2015-06-30 v2 Computer Science and Game Theory
Abstract
We consider the degrees of non-computability (Weihrauch degrees) of finding winning strategies (or more generally, Nash equilibria) in infinite sequential games with certain winning sets (or more generally, outcome sets). In particular, we show that as the complexity of the winning sets increases in the difference hierarchy, the complexity of constructing winning strategies increases in the effective Borel hierarchy.
Keywords
Cite
@article{arxiv.1407.5587,
title = {Weihrauch degrees of finding equilibria in sequential games},
author = {Stephane Le Roux and Arno Pauly},
journal= {arXiv preprint arXiv:1407.5587},
year = {2015}
}
Comments
An extended abstract of this work has appeared in the Proceedings of CiE 2015