领土掠夺者对策与图的乱序
The Territorial Raider Game and Graph Derangements
摘要：
一个图$G=(V,E)$的乱序是一个内射函数$f:V\to V$，使得对于所有的$v\in V$，$f(v)\neq v$和$(v,f(v))\in E$。并不是所有的图承认一个乱序和以前的结果，其特征在于图与乱序使用邻域条件的子集$V$。我们建立了一个替代的标准存在的图上的乱序。我们分析了严格的纳什均衡的生物动机的领土袭击者游戏，多玩家的资源竞争的空间结构人口的基础上动物袭击和防御行为。我们发现一个图$G$允许一个错乱当且仅当在$G$上领土袭击者博弈存在一个严格的纳什均衡。
英文摘要：
A derangement of a graph $G=(V,E)$ is an injective function $f:V\to V$ such that for all $v\in V$, $f(v)\neq v$ and $(v,f(v))\in E$. 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$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
