We introduce a game where players selfishly choose a resource and endure a cost depending on the number of players choosing nearby resources. We model the influences among resources by a weighted graph, directed or not. These games are generalizations of well-known games like Wardrop and congestion games. We study the conditions of equilibria existence and their efficiency if they exist. We conclude with studies of games whose influences among resources can be modelled by simple graphs.

翻译：本文提出一种博弈模型，其中参与者自私地选择资源，并承受取决于选择相邻资源参与者数量的成本。我们通过加权图（有向或无向）对资源间的相互影响进行建模。这类博弈是Wardrop博弈与拥堵博弈等经典模型的推广。我们研究了均衡存在的条件及其存在时的效率特性。最后，我们对资源间影响可通过简单图建模的博弈进行了专题研究。