GuaranteeNash for Boolean games is NEXP−hard
Główni autorzy: | Ianovski, E, Ong, L |
---|---|
Format: | Conference item |
Wydane: |
2014
|
Podobne zapisy
-
Complexity of mixed equilibria in boolean games
od: Ianovski, E
Wydane: (2016) -
Simulating cardinal preferences in Boolean games: A proof technique
od: Ianovski, E, i wsp.
Wydane: (2018) -
The complexity of decision problems about equilibria in two-player Boolean games
od: Ianovski, E, i wsp.
Wydane: (2018) -
Expressiveness and Nash equilibrium in iterated Boolean games
od: Gutierrez, J, i wsp.
Wydane: (2021) -
Expressiveness and Nash equilibrium in iterated Boolean games
od: Gutierrez, J, i wsp.
Wydane: (2016)