Login / Signup
EGuaranteeNash for Boolean Games Is NEXP-Hard.
Egor Ianovski
Luke Ong
Published in:
KR (2014)
Keyphrases
</>
boolean games
game theory
propositional variables
game theoretic
learning algorithm
knowledge base
lower bound
incomplete information