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