A Caltech Library Service

Testing for separability is hard

Echenique, Federico (2014) Testing for separability is hard. . (Unpublished)

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


This paper shows that it is computationally hard to decide (or test) if a consumption data set is consistent with separable preferences.

Item Type:Report or Paper (Discussion Paper)
Related URLs:
URLURL TypeDescription Paper
Echenique, Federico0000-0002-1567-6770
Record Number:CaltechAUTHORS:20190702-095556303
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:96877
Deposited By: Tony Diaz
Deposited On:08 Jul 2019 17:26
Last Modified:03 Oct 2019 21:26

Repository Staff Only: item control page