On the monotonicity of games generated by symmetric submodular functions. (Q1410686)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1992933
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the monotonicity of games generated by symmetric submodular functions. |
scientific article; zbMATH DE number 1992933 |
Statements
On the monotonicity of games generated by symmetric submodular functions. (English)
0 references
14 October 2003
0 references
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.
0 references
graph
0 references
connectivity function
0 references
searching game
0 references
0.757915198802948
0 references
0.7316973805427551
0 references
0.7273772358894348
0 references
0.7245969772338867
0 references
