The territorial raider game and graph derangements

From MaRDI portal
Publication:313781

DOI10.1016/J.DAM.2016.03.016zbMATH Open1344.05097arXiv1507.06286OpenAlexW1577330635MaRDI QIDQ313781FDOQ313781


Authors: Nina Galanter, Dennis jun. Silva, Jonathan T. Rowell, J. Rychtář Edit this on Wikidata


Publication date: 12 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: A derangement of a graph G=(V,E) is an injective function f:VoV such that for all vinV, f(v)eqv and (v,f(v))inE. Not all graphs admit a derangement and previous results have characterized graphs with derangements using neighborhood conditions for subsets of V. 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 G admits a derangement if and only if there is a strict Nash equilibrium of the Territorial Raider game on G.


Full work available at URL: https://arxiv.org/abs/1507.06286




Recommendations




Cites Work


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)