The one-dimensional Euclidean domain: Finitely many obstructions are not enough
Abstract
We show that one-dimensional Euclidean preference profiles can not be characterized in terms of finitely many forbidden substructures. This result is in strong contrast to the case of single-peaked and single-crossing preference profiles, for which such finite characterizations have been derived in the literature.
- Publication:
-
arXiv e-prints
- Pub Date:
- June 2015
- DOI:
- 10.48550/arXiv.1506.03838
- arXiv:
- arXiv:1506.03838
- Bibcode:
- 2015arXiv150603838C
- Keywords:
-
- Computer Science - Computer Science and Game Theory