Research map / Learning theory and algorithms / Combinatorial and search optimization
Single-Peakedness and Total Unimodularity: New Polynomial-Time Algorithms for Multi-Winner Elections
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
- Polynomial-Time Algorithm for Thiele Voting Rules with Voter Interval Preferences (NeurIPS 2026 · similarity 0.89)
- Maintaining Proportional Committees with Dynamic Candidate Sets (ICML 2025 · similarity 0.88)
- Welfare Maximization in Perpetual Voting (Student Abstract) (AAAI 2024 · similarity 0.87)
- Participation Incentives in Approval-Based Committee Elections (AAAI 2024 · similarity 0.87)
- Multi-Winner Reconfiguration (NeurIPS 2024 · similarity 0.87)
- Refined Characterizations of Approval-Based Committee Scoring Rules (AAAI 2024 · similarity 0.86)
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.