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)