Research map / Learning theory and algorithms / Submodular and game algorithms
Preferences Single-Peaked on Nice Trees
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
- Preferences Single-Peaked on a Circle (AAAI 2017 · similarity 0.90)
- Proportional Representation under Single-Crossing Preferences Revisited (AAAI 2021 · similarity 0.87)
- Polynomial-Time Algorithm for Thiele Voting Rules with Voter Interval Preferences (NeurIPS 2026 · similarity 0.83)
- Maintaining Proportional Committees with Dynamic Candidate Sets (ICML 2025 · similarity 0.83)
- On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries (AAAI 2025 · similarity 0.82)
- Ranking with Multiple Oracles: From Weak to Strong Stochastic Transitivity (ICML 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.