Published January 18, 2014
| Submitted
Discussion Paper
Open
Testing for separability is hard
- Creators
-
Echenique, Federico
Chicago
Abstract
This paper shows that it is computationally hard to decide (or test) if a consumption data set is consistent with separable preferences.
Attached Files
Submitted - 1401.4499.pdf
Files
1401.4499.pdf
Files
(117.3 kB)
Name | Size | Download all |
---|---|---|
md5:97bf42376244a49eb64e6b4c803a2cf9
|
117.3 kB | Preview Download |
Additional details
- Eprint ID
- 96877
- Resolver ID
- CaltechAUTHORS:20190702-095556303
- Created
-
2019-07-08Created from EPrint's datestamp field
- Updated
-
2023-06-02Created from EPrint's last_modified field