Chatterjee, K, Ibsen-Jensen, R 
ORCID: 0000-0003-4783-0389, Jecker, I and Svoboda, J
(2022)
Complexity of Spatial Games.
.
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.
| Item Type: | Conference or Workshop Item (Unspecified) |
|---|---|
| Divisions: | Faculty of Science and Engineering > School of Electrical Engineering, Electronics and Computer Science |
| Depositing User: | Symplectic Admin |
| Date Deposited: | 02 Mar 2023 09:02 |
| Last Modified: | 24 Nov 2023 11:51 |
| DOI: | 10.4230/LIPIcs.FSTTCS.2022.11 |
| Open Access URL: | https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11 |
| Related URLs: | |
| URI: | https://livrepository.liverpool.ac.uk/id/eprint/3168673 |
Dimensions
Dimensions
