GuaranteeNash for Boolean games is NEXP−hard
Auteurs principaux: | Ianovski, E, Ong, L |
---|---|
Format: | Conference item |
Publié: |
2014
|
Documents similaires
-
Complexity of mixed equilibria in boolean games
par: Ianovski, E
Publié: (2016) -
Simulating cardinal preferences in Boolean games: A proof technique
par: Ianovski, E, et autres
Publié: (2018) -
The complexity of decision problems about equilibria in two-player Boolean games
par: Ianovski, E, et autres
Publié: (2018) -
Expressiveness and Nash equilibrium in iterated Boolean games
par: Gutierrez, J, et autres
Publié: (2021) -
Expressiveness and Nash equilibrium in iterated Boolean games
par: Gutierrez, J, et autres
Publié: (2016)