DValue for Boolean games is EXP-complete
Computer Science and Game Theory
2014-03-31 v1 Computational Complexity
Abstract
We show that the following problem is EXP-complete: given a rational v and a two player, zero-sum Boolean game G determine whether the value of G is at least v. The proof is via a translation of the proof of the same result for Boolean circuit games in Feigenbaum et al. (1995).
Cite
@article{arxiv.1403.7428,
title = {DValue for Boolean games is EXP-complete},
author = {Egor Ianovski},
journal= {arXiv preprint arXiv:1403.7428},
year = {2014}
}