A Caltech Library Service


Chambers, Christopher P. and Echenique, Federico (2006) Supermodularizability. Social Science Working Paper, 1248. California Institute of Technology , Pasadena, CA. (Unpublished)

[img] PDF (SSWP 1248 - Feb. 2006) - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


We study the ordinal content of assuming supermodularity, including conditions under which a binary relation can be represented by a supermodular function. When applied to revealed-preference relations, our results imply that supermodularity is some times not refutable: A consumer’s choices can be rationalized with a supermodular utility function if they can be rationalized with a monotonic utility function. Hence, supermodularity is not empirically distinguishable from monotonicity. We present applications to assortative matching, decision under uncertainty, and to testing production technologies.

Item Type:Report or Paper (Working Paper)
Chambers, Christopher P.0000-0001-8253-0328
Echenique, Federico0000-0002-1567-6770
Group:Social Science Working Papers
Subject Keywords:Supermodular, Quasisupermodular, Afriat's Theorem, Assortative Matching, Uncertainty Aversion, Choquet Expected Utility
Series Name:Social Science Working Paper
Issue or Number:1248
Classification Code:JEL: D11, D24, C78
Record Number:CaltechAUTHORS:20170802-103018989
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:79750
Deposited By: Hanna Storlie
Deposited On:02 Aug 2017 17:46
Last Modified:09 Mar 2020 13:18

Repository Staff Only: item control page