Research map / Learning theory and algorithms / Prediction and decision losses
Recognising Multidimensional Euclidean Preferences
Dominik Peters
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| recognise preferences using the usual Euclidean ℓ2 metric in fixed dimension d ≥ 2 | d-Euclidean preference profiles · d-Euclidean preference profiles, fixed d ≥ 2 | recognition complexity: ∃R-complete | Hurt |
| restrict the dimension to one | Euclidean preference recognition · 1-Euclidean preference profiles | recognition complexity: polynomial-time | Improved |
| allow dichotomous preferences, including uniform-ball approval preferences | d-Euclidean preference recognition · Dichotomous profiles, fixed d ≥ 2 | recognition complexity: ∃R-complete | No clear effect |
| replace the Euclidean ℓ2 metric with the ℓ1 metric | Euclidean preference recognition · ℓ1-Euclidean preference profiles, d ≥ 1 | recognition complexity: contained in NP | Improved |
| replace the Euclidean ℓ2 metric with the ℓ∞ metric | Euclidean preference recognition · ℓ∞-Euclidean preference profiles, d ≥ 1 | recognition complexity: contained in NP | Improved |
| use nlsat to test 2- or 3-Euclidean recognition on PrefLib profiles | nlsat · PrefLib profiles tested | solver decision within time limit: one hour | Hurt |
| seek a finite forbidden-configuration characterisation | d-Euclidean domain · d-Euclidean preference profiles, d ≥ 1 | existence of finite characterisation | Hurt |
Closest papers by meaning
- Restricted Domains of Dichotomous Preferences with Possibly Incomplete Information (AAAI 2021 · similarity 0.86)
- Independence of Irrelevant Alternatives under the Lens of Pairwise Distortion (AAAI 2024 · similarity 0.84)
- Improved Metric Distortion via Threshold Approvals (AAAI 2024 · similarity 0.82)
- Selective Preference Aggregation (ICML 2025 · similarity 0.82)
- Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures (ICML 2025 · similarity 0.82)
- Checking Consistency of CP-Theory Preferences in Polynomial Time (AAAI 2025 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
