Research map / Learning theory and algorithms / Submodular and game algorithms
On Recognising Nearly Single-Crossing Preferences
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Proportional Representation under Single-Crossing Preferences Revisited (AAAI 2021 · similarity 0.88)
- Exact Learning of Preference Structure: Single-peaked Preferences and Beyond (ICML 2022 · similarity 0.88)
- Proportional Fairness in Clustering: A Social Choice Perspective (NeurIPS 2024 · similarity 0.85)
- Proportional Aggregation of Preferences for Sequential Decision Making (AAAI 2024 · similarity 0.85)
- Spatial Voting with Incomplete Voter Information (AAAI 2024 · similarity 0.84)
- On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries (AAAI 2025 · similarity 0.84)
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.