On the monotonicity of games generated by symmetric submodular functions. (Q1410686)

A graph searching game has as objective to capture an omniscient fugitive residing on the vertices or/and edges of a graph by systematically moving a specific number of searchers on it. In the majority of the cases, the minimum number of searchers required to capture the fugitive is equivalent to some known graph theoretical parameter. In this paper it is shown how a graph parameter can be generated by a connectivity function and a general minimax theorem that characterizes it is provided.