Filters








1 Hit in 1.6 sec

EGuaranteeNash for Boolean Games is NEXP-Hard [article]

Egor Ianovski, Luke Ong
2013 arXiv   pre-print
We address this by showing that a natural decision problem about mixed equilibria: determining whether a Boolean game has a mixed strategy equilibrium that guarantees every player a given payoff, is NEXP-hard  ...  Accordingly, the ϵ variety of the problem is NEXP-complete.  ...  Acknowledgements Egor Ianovski is supported by a scholarship, and Luke Ong is partially supported by a grant, from the Oxford-Man Institute of Quantitative Finance.  ... 
arXiv:1312.4114v1 fatcat:y2zevkz5izdqloozofhiua2koq