GuaranteeNash for Boolean games is NEXP−hard
Главные авторы: | Ianovski, E, Ong, L |
---|---|
Формат: | Conference item |
Опубликовано: |
2014
|
Схожие документы
-
Complexity of mixed equilibria in boolean games
по: Ianovski, E
Опубликовано: (2016) -
Simulating cardinal preferences in Boolean games: A proof technique
по: Ianovski, E, и др.
Опубликовано: (2018) -
The complexity of decision problems about equilibria in two-player Boolean games
по: Ianovski, E, и др.
Опубликовано: (2018) -
Expressiveness and Nash equilibrium in iterated Boolean games
по: Gutierrez, J, и др.
Опубликовано: (2021) -
Expressiveness and Nash equilibrium in iterated Boolean games
по: Gutierrez, J, и др.
Опубликовано: (2016)