• 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  

      A graph-theoretic network security game 

      Mavronicolas, Marios; Lesta, Vicky Papadopoulou; Philippou, Anna; Spirakis, Paul G. (2008)
      Consider a network vulnerable to viral infection, where the security software can guarantee safety only to a limited part of it. We model this practical network scenario as a non-cooperative multi-player game on a graph, ...
    • 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. ...