Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Page will reload when a filter is removed.
Reset Filters
Applied Filters:
Author:
Remove Filter
Patrycja Piątek
Page will reload when a filter is removed.
Reset Filters
Show filters (1)
Author:
Remove Filter
Patrycja Piątek
GuaranteeNash for Boolean game...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
GuaranteeNash for Boolean games is NEXP−hard
Bibliographic Details
Main Authors:
Ianovski, E
,
Ong, L
Format:
Conference item
Published:
2014
Holdings
Description
Similar Items
Staff View
Similar Items
Complexity of mixed equilibria in boolean games
by: Ianovski, E
Published: (2016)
Simulating cardinal preferences in Boolean games: A proof technique
by: Ianovski, E, et al.
Published: (2018)
The complexity of decision problems about equilibria in two-player Boolean games
by: Ianovski, E, et al.
Published: (2018)
Expressiveness and Nash equilibrium in iterated Boolean games
by: Gutierrez, J, et al.
Published: (2021)
Expressiveness and Nash equilibrium in iterated Boolean games
by: Gutierrez, J, et al.
Published: (2016)