English

Testing for separability is hard

Computer Science and Game Theory 2014-01-21 v1

Abstract

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

Cite

@article{arxiv.1401.4499,
  title  = {Testing for separability is hard},
  author = {Federico Echenique},
  journal= {arXiv preprint arXiv:1401.4499},
  year   = {2014}
}
R2 v1 2026-06-22T02:48:41.907Z