GuaranteeNash for Boolean games is NEXP−hard
Main Authors: | Ianovski, E, Ong, L |
---|---|
Format: | Conference item |
Published: |
2014
|
Similar Items
-
Complexity of mixed equilibria in boolean games
by: Ianovski, E
Published: (2016) -
Simulating cardinal preferences in Boolean games: A proof technique
by: Ianovski, E, et al.
Published: (2018) -
The complexity of decision problems about equilibria in two-player Boolean games
by: Ianovski, E, et al.
Published: (2018) -
Expressiveness and Nash equilibrium in iterated Boolean games
by: Gutierrez, J, et al.
Published: (2021) -
Expressiveness and Nash equilibrium in iterated Boolean games
by: Gutierrez, J, et al.
Published: (2016)