Concurrent Games with Multiple Topologies

Authors Shaull Almagor , Shai Guendelman

Thumbnail PDF


  • Filesize: 0.78 MB
  • 18 pages

Document Identifiers

Author Details

Shaull Almagor
  • Department of Computer Science, Technion, Haifa, Israel
Shai Guendelman
  • Department of Computer Science, Technion, Haifa Israel

Cite AsGet BibTex

Shaull Almagor and Shai Guendelman. Concurrent Games with Multiple Topologies. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 243, pp. 34:1-34:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


Concurrent multi-player games with ω-regular objectives are a standard model for systems that consist of several interacting components, each with its own objective. The standard solution concept for such games is Nash Equilibrium, which is a "stable" strategy profile for the players. In many settings, the system is not fully observable by the interacting components, e.g., due to internal variables. Then, the interaction is modelled by a partial information game. Unfortunately, the problem of whether a partial information game has an NE is not known to be decidable. A particular setting of partial information arises naturally when processes are assigned IDs by the system, but these IDs are not known to the processes. Then, the processes have full information about the state of the system, but are uncertain of the effect of their actions on the transitions. We generalize the setting above and introduce Multi-Topology Games (MTGs) - concurrent games with several possible topologies, where the players do not know which topology is actually used. We show that extending the concept of NE to these games can take several forms. To this end, we propose two notions of NE: Conservative NE, in which a player deviates if she can strictly add topologies to her winning set, and Greedy NE, where she deviates if she can win in a previously-losing topology. We study the properties of these NE, and show that the problem of whether a game admits them is decidable.

Subject Classification

ACM Subject Classification
  • Theory of computation → Algorithmic game theory
  • Theory of computation → Automata over infinite objects
  • Concurrent games
  • Nash Equilibrium
  • Symmetry
  • Partial information


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Shaull Almagor. Process symmetry in probabilistic transducers. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020. Google Scholar
  2. Shaull Almagor, Guy Avni, and Orna Kupferman. Repairing multi-player games. In 26th International Conference on Concurrency Theory (CONCUR 2015). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2015. Google Scholar
  3. Raphaël Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin, and Moshe Y Vardi. Strategy logic with imperfect information. ACM Transactions on Computational Logic (TOCL), 22(1):1-51, 2021. Google Scholar
  4. Udi Boker. Why these automata types? In LPAR, volume 18, pages 143-163, 2018. Google Scholar
  5. Patricia Bouyer, Nicolas Markey, and Steen Vester. Nash equilibria in symmetric graph games with partial observation. Information and Computation, 254:238-258, 2017. Google Scholar
  6. Patricia P Bouyer, Romain Brenguier, and Nicolas N Markey. Pure nash equilibria in concurrent games. Logical methods in computer science, 2015. Google Scholar
  7. Felix Brandt, Felix Fischer, and Markus Holzer. Equilibria of graphical games with symmetries. Theoretical Computer Science, 412(8-10):675-685, 2011. Google Scholar
  8. Romain Brenguier, Arno Pauly, Jean-François Raskin, and Ocan Sankur. Admissibility in games with imperfect information. In CONCUR 2017-28th International Conference on Concurrency Theory, volume 85, pages 2:1-2:23. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. Google Scholar
  9. Krishnendu Chatterjee and Laurent Doyen. The complexity of partial-observation parity games. In International Conference on Logic for Programming Artificial Intelligence and Reasoning, pages 1-14. Springer, 2010. Google Scholar
  10. Krishnendu Chatterjee and Laurent Doyen. Games with a weak adversary. In International Colloquium on Automata, Languages, and Programming, pages 110-121. Springer, 2014. Google Scholar
  11. Krishnendu Chatterjee, Thomas A Henzinger, and Nir Piterman. Strategy logic. Information and Computation, 208(6):677-693, 2010. Google Scholar
  12. Edmund M. Clarke, Reinhard Enders, Thomas Filkorn, and Somesh Jha. Exploiting symmetry in temporal logic model checking. Formal methods in system design, 9(1):77-104, 1996. Google Scholar
  13. Luca De Alfaro, Thomas A Henzinger, and Orna Kupferman. Concurrent reachability games. Theoretical computer science, 386(3):188-217, 2007. Google Scholar
  14. Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, and Szymon Toruńczyk. Energy and mean-payoff games with imperfect information. In International Workshop on Computer Science Logic, pages 260-274. Springer, 2010. Google Scholar
  15. E Allen Emerson and A Prasad Sistla. Symmetry and model checking. Formal methods in system design, 9(1):105-131, 1996. Google Scholar
  16. Bernd Finkbeiner and Sven Schewe. Coordination logic. In International Workshop on Computer Science Logic, pages 305-319. Springer, 2010. Google Scholar
  17. Nicholas Ham. Notions of anonymity, fairness and symmetry for finite strategic-form games. arXiv preprint, 2013. URL:
  18. C Norris Ip and David L Dill. Better verification through symmetry. In Computer Hardware Description Languages and their Applications, pages 97-111. Elsevier, 1993. Google Scholar
  19. Anthony W Lin, Truong Khanh Nguyen, Philipp Rümmer, and Jun Sun. Regular symmetry patterns. In International Conference on Verification, Model Checking, and Abstract Interpretation, pages 455-475. Springer, 2016. Google Scholar
  20. Bastien Maubert. Logical foundations of games with imperfect information: uniform strategies. PhD thesis, Université Rennes 1, 2014. Google Scholar
  21. Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay V. Vazirani, editors. Algorithmic Game Theory. Cambridge University Press, 2007. URL:
  22. Jean-François Raskin, Thomas A Henzinger, Laurent Doyen, and Krishnendu Chatterjee. Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science, 3, 2007. Google Scholar
  23. Noah Daniel Stein. Exchangeable equilibria. PhD thesis, Massachusetts Institute of Technology, 2011. Google Scholar
  24. Fernando A Tohmé and Ignacio D Viglizzo. Structural relations of symmetry among players in strategic games. International Journal of General Systems, 48(4):443-461, 2019. Google Scholar
  25. M Ummels and DK Wojtczak. The complexity of nash equilibria in stochastic multiplayer games. Logical Methods in Computer Science, 2010. Google Scholar
  26. Steen Vester. Symmetric Nash Equilibria. PhD thesis, Master’s thesis, ENS Cachan, 2012. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail