Submodularity, supermodularity, and higher-order monotonicities of pseudo-Boolean functions

Submodularity, supermodularity, and higher-order monotonicities of pseudo-Boolean functions

0.00 Avg rating0 Votes
Article ID: iaor20061437
Country: United States
Volume: 30
Issue: 2
Start Page Number: 453
End Page Number: 461
Publication Date: May 2005
Journal: Mathematics of Operations Research
Authors: ,
Abstract:

Classes of set functions defined by the positivity or negativity of the higher-order derivatives of their pseudo-Boolean polynomial representations generalize those of monotone, supermodular, and submodular functions. In this paper, these classes are characterized by functional inequalities and are shown to be closed both under algebaric closure conditions and a local closure criterion. It is shown that for every m = 1, in addition to the class of all set functions, there are only three other classes satisfying these algebraic and local closure conditions: those having positive, respectively negative, mth-order derivatives, and those haveing a polynomial representation of degree less than m.

Reviews

Required fields are marked *. Your email address will not be published.