• Conference Object  

      A catalog of ∃ℝ-complete decision problems about Nash equilibria in multi-player games 

      Bilò, Vittorio; Mavronicolas, Marios (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, ...
    • Article  

      The complexity of decision problems about nash equilibria in win-lose games 

      Bilò, Vittorio; Mavronicolas, Marios (2012)
      We revisit the complexity of deciding, given a (finite) strategic game, whether Nash equilibria with certain natural properties exist
    • Article  

      Complexity of rational and irrational Nash equilibria 

      Bilò, Vittorio; Mavronicolas, Marios (2011)
      We introduce two new decision problems, denoted as ∃ RATIONAL NASH and ∃ IRRATIONAL NASH, pertinent to the rationality and irrationality, respectively, of Nash equilibria for (finite) strategic games. These problems ask, ...
    • Article  

      Complexity of rational and irrational nash equilibria 

      Bilò, Vittorio; Mavronicolas, Marios (2014)
      We introduce two new natural decision problems, denoted as ∃ RATIONAL NASH and ∃ IRRATIONAL NASH, pertinent to the rationality and irrationality, respectively, of Nash equilibria for (finite) strategic games. These problems ...
    • Conference Object  

      ∃ℝ-complete decision problems about symmetric nash equilibria in symmetric multi-player games 

      Bilò, Vittorio; Mavronicolas, Marios (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. ...