Complexity of spatial games

DOI10.4230/LIPICS.FSTTCS.2022.11MaRDI QIDQ6604612zbMATH OpenFDO

Authors Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda

Publication date 12 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2022.11

zbMATH Keywords

computational complexitydynamical systemsprisoner's dilemmaspatial games

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

This page was built for publication: Complexity of spatial games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604612)