Published August 2, 2017
| Submitted
Report
Open
Supermodularizability
Abstract
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.
Attached Files
Submitted - sswp1248.pdf
Files
sswp1248.pdf
Files
(173.7 kB)
Name | Size | Download all |
---|---|---|
md5:bd114d2356009c45b282febe1af0d856
|
173.7 kB | Preview Download |
Additional details
- Eprint ID
- 79750
- Resolver ID
- CaltechAUTHORS:20170802-103018989
- Created
-
2017-08-02Created from EPrint's datestamp field
- Updated
-
2020-03-09Created from EPrint's last_modified field
- Caltech groups
- Social Science Working Papers
- Series Name
- Social Science Working Paper
- Series Volume or Issue Number
- 1248