---
res:
  bibo_abstract:
  - 'Spatial games form a widely-studied class of games from biology and physics modeling
    the evolution of social behavior. Formally, such a game is defined by a square
    (d by d) payoff matrix M and an undirected graph G. Each vertex of G represents
    an individual, that initially follows some strategy i ∈ {1,2,…,d}. In each round
    of the game, every individual plays the matrix game with each of its neighbors:
    An individual following strategy i meeting a neighbor following strategy j receives
    a payoff equal to the entry (i,j) of M. Then, each individual updates its strategy
    to its neighbors'' strategy with the highest sum of payoffs, and the next round
    starts. The basic computational problems consist of reachability between configurations
    and the average frequency of a strategy. For general spatial games and graphs,
    these problems are in PSPACE. In this paper, we examine restricted setting: the
    game is a prisoner’s dilemma; and G is a subgraph of grid. We prove that basic
    computational problems for spatial games with prisoner’s dilemma on a subgraph
    of a grid are PSPACE-hard.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Krishnendu
      foaf_name: Chatterjee, Krishnendu
      foaf_surname: Chatterjee
      foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-4561-241X
  - foaf_Person:
      foaf_givenName: Rasmus
      foaf_name: Ibsen-Jensen, Rasmus
      foaf_surname: Ibsen-Jensen
      foaf_workInfoHomepage: http://www.librecat.org/personId=3B699956-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0003-4783-0389
  - foaf_Person:
      foaf_givenName: Ismael R
      foaf_name: Jecker, Ismael R
      foaf_surname: Jecker
      foaf_workInfoHomepage: http://www.librecat.org/personId=85D7C63E-7D5D-11E9-9C0F-98C4E5697425
  - foaf_Person:
      foaf_givenName: Jakub
      foaf_name: Svoboda, Jakub
      foaf_surname: Svoboda
      foaf_workInfoHomepage: http://www.librecat.org/personId=130759D2-D7DD-11E9-87D2-DE0DE6697425
    orcid: 0000-0002-1419-3267
  bibo_doi: 10.4230/LIPIcs.FSTTCS.2022.11
  bibo_volume: 250
  dct_date: 2022^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/1868-8969
  - http://id.crossref.org/issn/9783959772617
  dct_language: eng
  dct_publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik@
  dct_title: Complexity of spatial games@
...