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)