相关论文: A graph theoretic approach for modelling wildlife …

A generic property of biological, social and economical networks is their ability to evolve in time, creating and suppressing interactions. We approach this issue within the framework of an adaptive network of agents playing a Prisoner's…

We introduce a class of strategic games in which agents are assigned to nodes of a topology graph and the utility of an agent depends on both the agent's inherent utilities for other agents as well as her distance from these agents on the…

We consider discrete dynamical systems of "ant-like" agents engaged in a sequence of pursuits on a graph environment. The agents emerge one by one at equal time intervals from a source vertex $s$ and pursue each other by greedily attempting…

This paper describes a new approach to the problem of the structural research of clusters based on the theory of geodetic and k-geodetic graphs. We firmly believe that this same approach can be used when solving problems of correlation…

We propose and study a strategic model of hiding in a network, where the network designer chooses the links and his position in the network facing the seeker who inspects and disrupts the network. We characterize optimal networks for the…

The study of ecological networks is crucial for modern conservation biology, addressing habitat fragmentation and biodiversity loss, especially in complex regions. These networks, including corridors, sources, and nodes, are key for species…

Coordination games have been of interest to game theorists, economists, and ecologists for many years to study such problems as the emergence of local conventions and the evolution of cooperative behavior. Approaches for understanding the…

Game theory provides a quantitative framework for analyzing the behavior of rational agents. The Iterated Prisoner's Dilemma in particular has become a standard model for studying cooperation and cheating, with cooperation often emerging as…

We study graph classes modeled by families of non-crossing (NC) connected sets. Two classic graph classes in this context are disk graphs and proper interval graphs. We focus on the cases when the sets are paths and the host is a tree…

The Prisoner's Dilemma Process on a graph $G$ is an iterative process where each vertex, with a fixed strategy (cooperate or defect), plays the game with each of its neighbours. At the end of a round each vertex may change its strategy to…

Context - Prioritising is likely to differ depending on the species considered for connectivity assessments, leading to a lack of consensual decisions for territorial planning. Objectives - The objective was to assess the relevance of…

Dryland vegetation can survive water stress by forming spatial patterns but is often subjected to herbivory as an additional stress that puts it at risk of desertification. Understanding the mutual relationships between vegetation…

The real world is awash with multi-agent problems that require collective action by self-interested agents, from the routing of packets across a computer network to the management of irrigation systems. Such systems have local incentives…

In this work we investigate the betweenness centrality in geographical networks and its relationship with network communities. We show that vertices with large betweenness define what we call characteristic betweenness paths in both modeled…

To solve many problems on graphs, graph traversals are used, the usual variants of which are the depth-first search and the breadth-first search. Implementing a graph traversal we consequently reach all vertices of the graph that belong to…

Nonuniform spatial distributions of vegetation in scarce environments consist of either gaps, bands often called tiger bush or patches that can be either self-organized or spatially localized in space. When the level of aridity is…

Recent developments of eco-evolutionary models have shown that evolving feedbacks between behavioral strategies and the environment of game interactions, leading to changes in the underlying payoff matrix, can impact the underlying…

We present an incentive model for route distribution in the context of path vector routing protocols and we focus on the Border Gateway Protocol (BGP). BGP is the de-facto protocol for interdomain routing on the Internet. We model BGP route…

Network visualization is essential for many scientific, societal, technological and artistic domains. The primary goal is to highlight patterns out of nodes interconnected by edges that are easy to understand, facilitate communication and…

Many discrete optimization problems amount to selecting a feasible set of edges of least weight. We consider in this paper the context of spatial graphs where the positions of the vertices are uncertain and belong to known uncertainty sets.…