The one-dimensional Euclidean domain: Finitely many obstructions are not enough
classification
💻 cs.GT
keywords
euclideanfinitelymanyone-dimensionalpreferenceprofilesbeencase
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.