The Firefighter problem with dynamic defence costs

The Firefighter Problem is a single-player game modelling the spread of a contagion (e.g. rumours, diseases) on a graph. The player's objective is to defend vertices to protect at least a given number. This problem is computationally hard, but it can be solved efficiently on certain restricted classes of graph, such as complete graphs (in constant time) and graphs with path length at most [Formula: see text] (in [Formula: see text]-time). We define The Cost Function Firefighter Problem, the first variant of the Firefighter problem that introduces vertex defence costs depending on time and game state. We show the Cost Function problem is computationally hard even for classes of trees on which the classic problem is tractable, but tractable on some very restricted graph classes (complete graphs, graphs of fixed bounded path length and trees under certain conditions). By expressing our variant in monadic second-order logic, we prove it is fixed-parameter tractable with respect to treewidth, budget, and maximum time step. To complement theoretical findings, we undertake empirical investigation to compare performance of cost, threat and degree-based heuristics under various cost functions. We find that the relative effectiveness of these heuristics depends heavily on graph structure, with degree-based heuristics generally performing worse than state-based strategies. We show how these heuristics play out on both random and real-world interaction graphs.