DValue for Boolean games is EXP-complete
classification
💻 cs.GT
cs.CC
keywords
booleanexp-completegamesproofcircuitdeterminedvaluefeigenbaum
read the original 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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.