Abstract:
The paper studies structured preferences domains that avoid configuration with three different third elements in three elements restrictions (Arrow’s single-peaked domains). The number of Arrow’s single-peaked domains and the number of non-isomorphic classes of Arrow’s single-peaked domains are found. We present a forbidden submatrix characterization for matrix representation of Arrow’s single-peaked preferences.
