On the monotonicity of games generated by symmetric submodular functions

dc.contributor.author	Fomin, Fedor V.
dc.contributor.author	Thilikos Touloupas, Dimitrios
dc.contributor.other	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned	2016-12-01T16:57:38Z
dc.date.available	2016-12-01T16:57:38Z
dc.date.issued	2001-02
dc.identifier.citation	Fomin, F., Thilikos, D. "On the monotonicity of games generated by symmetric submodular functions". 2001.
dc.identifier.uri	http://hdl.handle.net/2117/97642
dc.description.abstract	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.
dc.format.extent	17 p.
dc.language.iso	eng
dc.relation.ispartofseries	LSI-01-5-R
dc.subject	Àrees temàtiques de la UPC::Informàtica
dc.subject.other	Submodularity
dc.subject.other	Linear-width
dc.subject.other	Cutwidth
dc.subject.other	Search games
dc.title	On the monotonicity of games generated by symmetric submodular functions
dc.type	External research report
dc.rights.access	Open Access
local.identifier.drac	1903020
dc.description.version	Postprint (published version)
local.citation.author	Fomin, F.; Thilikos, D.

UPCommons. Portal del coneixement obert de la UPC