Supermodularity
   HOME

TheInfoList



OR:

In mathematics, a function :f\colon \mathbb^k \to \mathbb is supermodular if : f(x \uparrow y) + f(x \downarrow y) \geq f(x) + f(y) for all x, y \isin \mathbb^, where x \uparrow y denotes the componentwise maximum and x \downarrow y the componentwise minimum of x and y. If −''f'' is supermodular then ''f'' is called submodular, and if the inequality is changed to an equality the function is modular. If ''f'' is twice continuously differentiable, then supermodularity is equivalent to the condition : \frac \geq 0 \mbox i \neq j.


Supermodularity in economics and game theory

The concept of supermodularity is used in the social sciences to analyze how one agent's decision affects the incentives of others. Consider a
symmetric game In game theory, a symmetric game is a game where the payoffs for playing a particular strategy depend only on the other strategies employed, not on who is playing them. If one can change the identities of the players without changing the payoff to ...
with a smooth payoff function \,f defined over actions \,z_i of two or more players i \in . Suppose the action space is continuous; for simplicity, suppose each action is chosen from an interval: z_i \in ,b/math>. In this context, supermodularity of \,f implies that an increase in player \,i's choice \,z_i increases the marginal payoff df/dz_j of action \,z_j for all other players \,j. That is, if any player \,i chooses a higher \,z_i, all other players \,j have an incentive to raise their choices \,z_j too. Following the terminology of Bulow, Geanakoplos, and Klemperer (1985), economists call this situation
strategic complementarity In economics and game theory, the decisions of two or more players are called strategic complements if they mutually reinforce one another, and they are called strategic substitutes if they mutually offset one another. These terms were originally ...
, because players' strategies are complements to each other. This is the basic property underlying examples of multiple equilibria in
coordination game A coordination game is a type of simultaneous game found in game theory. It describes the situation where a player will earn a higher payoff when they select the same course of action as another player. The game is not one of pure conflict, which r ...
s. The opposite case of supermodularity of \,f, called submodularity, corresponds to the situation of strategic substitutability. An increase in \,z_i lowers the marginal payoff to all other player's choices \,z_j, so strategies are substitutes. That is, if \,i chooses a higher \,z_i, other players have an incentive to pick a ''lower'' \,z_j. 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 As a topic of economics, utility is used to model worth or value. Its usage has evolved significantly over time. The term was introduced initially as a measure of pleasure or happiness as part of the theory of utilitarianism by moral philosoph ...
is often related to
complementary goods In economics, a complementary good is a good whose appeal increases with the popularity of its complement. Technically, it displays a negative cross elasticity of demand and that demand for it increases when the price of another good decreases. I ...
. However, this view is disputed.


Submodular functions of subsets

Supermodularity and submodularity are also defined for functions defined over subsets of a larger set. Intuitively, a submodular function over the subsets demonstrates "diminishing returns". There are specialized techniques for optimizing submodular functions. Let ''S'' be a finite set. A function f\colon 2^S \to \mathbb is submodular if for any A \subset B \subset S and x \in S \setminus B, f(A \cup \)-f(A) \geq f(B \cup \)-f(B). For supermodularity, the inequality is reversed. The definition of submodularity can equivalently be formulated as : f(A)+f(B) \geq f(A \cap B) + f(A \cup B) for all subsets ''A'' and ''B'' of ''S''. Theory and enumeration algorithms for finding local and global maxima (minima) of submodular (supermodular) functions can be found in B. Goldengorin. European Journal of Operational Research 198(1):102-112, DOI: 10.1016/j.ejor.2008.08.022


See also

* Pseudo-Boolean function * Topkis's theorem * Submodular set function * Superadditive *
Utility functions on indivisible goods Some branches of economics and game theory deal with indivisible goods, discrete items that can be traded only as a whole. For example, in combinatorial auctions there is a finite set of items, and every agent can buy a subset of the items, but an ...


Notes and references

{{DEFAULTSORT:Supermodular Function Order theory Optimization of ordered sets Generalized convexity Supermodular functions