Supermodular function: Difference between revisions

Content deleted Content added
Yobot (talk | contribs)
m WP:CHECKWIKI error 61 fixes + general fixes, References after punctuation per WP:REFPUNC and WP:PAIC using AWB (7671)
No edit summary
Line 9:
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 smoothtwice continuously differentiable, then supermodularity is equivalent to the condition<ref>The equivalence between the definition of supermodularity and its calculus formulation is sometimes called ''Topkis' Characterization Theorem''. See Paul Milgrom and John Roberts (1990), 'Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities', ''Econometrica'' 58 (6), page 1261.</ref>
 
:<math> \frac{\partial ^2 f}{\partial z_i\, \partial z_j} \geq 0 \mbox{ for all } i \neq j.</math>