Πλοήγηση Τμήμα Πληροφορικής / Department of Computer Science ανά Θέμα "∃ℝ-completeness"
Αποτελέσματα 1-2 από 2
-
Conference Object
A catalog of ∃ℝ-complete decision problems about Nash equilibria in multi-player games
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016)[Schaefer and Štefankovic, Theory of Computing Systems, 2015] provided an explicit formulation of ∃ℝ as the class capturing the complexity of deciding the Existential Theory of the Reals, and established that deciding, ...
-
Conference Object
∃ℝ-complete decision problems about symmetric nash equilibria in symmetric multi-player games
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)We study the complexity of decision problems about symmetric Nash equilibria for symmetric multi-player games. These decision problems concern the existence of a symmetric Nash equilibrium with certain natural properties. ...