GuaranteeNash for Boolean games is NEXP−hard
Príomhchruthaitheoirí: | Ianovski, E, Ong, L |
---|---|
Formáid: | Conference item |
Foilsithe / Cruthaithe: |
2014
|
Míreanna comhchosúla
-
Complexity of mixed equilibria in boolean games
de réir: Ianovski, E
Foilsithe / Cruthaithe: (2016) -
Simulating cardinal preferences in Boolean games: A proof technique
de réir: Ianovski, E, et al.
Foilsithe / Cruthaithe: (2018) -
The complexity of decision problems about equilibria in two-player Boolean games
de réir: Ianovski, E, et al.
Foilsithe / Cruthaithe: (2018) -
Expressiveness and Nash equilibrium in iterated Boolean games
de réir: Gutierrez, J, et al.
Foilsithe / Cruthaithe: (2021) -
Expressiveness and Nash equilibrium in iterated Boolean games
de réir: Gutierrez, J, et al.
Foilsithe / Cruthaithe: (2016)