On the monotonicity of games generated by symmetric submodular functions
Submodular functions have appeared to be a key tool for proving the monotonicity of several graph searching games. In this paper we provide a general game theoretic framework able to unify old and new monotonicity results in a unique min-max theorem. Our theorem, provides a game theoretic analogue t...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2001 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/97642 |
| Acceso en línea: | https://hdl.handle.net/2117/97642 |
| Access Level: | acceso abierto |
| Palabra clave: | Submodularity Linear-width Cutwidth Search games Àrees temàtiques de la UPC::Informàtica |
| Sumario: | Submodular functions have appeared to be a key tool for proving the monotonicity of several graph searching games. In this paper we provide a general game theoretic framework able to unify old and new monotonicity results in a unique min-max theorem. Our theorem, provides a game theoretic analogue to a wide number of graph theoretic parameters such as linear-width and cutwidth. |
|---|