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)