GuaranteeNash for Boolean games is NEXP−hard
Váldodahkkit: | Ianovski, E, Ong, L |
---|---|
Materiálatiipa: | Conference item |
Almmustuhtton: |
2014
|
Geahča maid
-
Complexity of mixed equilibria in boolean games
Dahkki: Ianovski, E
Almmustuhtton: (2016) -
Simulating cardinal preferences in Boolean games: A proof technique
Dahkki: Ianovski, E, et al.
Almmustuhtton: (2018) -
The complexity of decision problems about equilibria in two-player Boolean games
Dahkki: Ianovski, E, et al.
Almmustuhtton: (2018) -
Expressiveness and Nash equilibrium in iterated Boolean games
Dahkki: Gutierrez, J, et al.
Almmustuhtton: (2021) -
Expressiveness and Nash equilibrium in iterated Boolean games
Dahkki: Gutierrez, J, et al.
Almmustuhtton: (2016)