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)