GuaranteeNash for Boolean games is NEXP−hard
Egile Nagusiak: | Ianovski, E, Ong, L |
---|---|
Formatua: | Conference item |
Argitaratua: |
2014
|
Antzeko izenburuak
-
Complexity of mixed equilibria in boolean games
nork: Ianovski, E
Argitaratua: (2016) -
Simulating cardinal preferences in Boolean games: A proof technique
nork: Ianovski, E, et al.
Argitaratua: (2018) -
The complexity of decision problems about equilibria in two-player Boolean games
nork: Ianovski, E, et al.
Argitaratua: (2018) -
Expressiveness and Nash equilibrium in iterated Boolean games
nork: Gutierrez, J, et al.
Argitaratua: (2021) -
Expressiveness and Nash equilibrium in iterated Boolean games
nork: Gutierrez, J, et al.
Argitaratua: (2016)