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