The territorial raider game and graph derangements
From MaRDI portal
(Redirected from Publication:313781)
Abstract: A derangement of a graph is an injective function such that for all , and . Not all graphs admit a derangement and previous results have characterized graphs with derangements using neighborhood conditions for subsets of . We establish an alternative criterion for the existence of derangements on a graph. We analyze strict Nash equilibria of the biologically motivated Territorial Raider Game, a multi-player competition for resources in a spatially structured population based on animal raiding and defending behavior. We find that a graph admits a derangement if and only if there is a strict Nash equilibrium of the Territorial Raider game on .
Recommendations
Cites work
- scientific article; zbMATH DE number 1306865 (Why is no real title available?)
- scientific article; zbMATH DE number 1919530 (Why is no real title available?)
- A general framework for analysing multiplayer games in networks using territorial interactions as a case study
- A study of the dynamics of multi-player games on small networks using territorial interactions
- Analysing territorial models on graphs
- Games with randomly disturbed payoffs: a new rationale for mixed-strategy equilibrium points
- The 1-Factors of Oriented Graphs
Cited in
(2)
This page was built for publication: The territorial raider game and graph derangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313781)