Supermodular Function
Supermodular Function
In mathematics, a function
is supermodular if
for all , , where denotes the componentwise maximum and the componentwise
minimum of and .
If −f is supermodular then f is called submodular, and if the inequality is changed to an equality the
function is modular.
Consider a symmetric game with a smooth payoff function defined over actions of two or more
players . Suppose the action space is continuous; for simplicity, suppose each action is
chosen from an interval: . In this context, supermodularity of implies that an increase in player
's choice increases the marginal payoff of action for all other players . That is, if any
player chooses a higher , all other players have an incentive to raise their choices too. Following
the terminology of Bulow, Geanakoplos, and Klemperer (1985), economists call this situation strategic
complementarity, because players' strategies are complements to each other.[2] This is the basic property
underlying examples of multiple equilibria in coordination games.[3]
The opposite case of supermodularity of , called submodularity, corresponds to the situation of strategic
substitutability. An increase in lowers the marginal payoff to all other player's choices , so strategies
are substitutes. That is, if chooses a higher , other players have an incentive to pick a lower .
For example, Bulow et al. consider the interactions of many imperfectly competitive firms. When an
increase in output by one firm raises the marginal revenues of the other firms, production decisions are
strategic complements. When an increase in output by one firm lowers the marginal revenues of the other
firms, production decisions are strategic substitutes.
A supermodular utility function is often related to complementary goods. However, this view is disputed.[4]
Theory and enumeration algorithms for finding local and global maxima (minima) of submodular
(supermodular) functions can be found in "Maximization of submodular functions: Theory and
enumeration algorithms", B. Goldengorin.[5]
See also
Pseudo-Boolean function
Topkis's theorem
Submodular set function
Superadditive
Utility functions on indivisible goods