Research map / Learning theory and algorithms / Sample complexity
Approximate Inference of Outcomes in Probabilistic 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
- Comparing Election Methods Where Each Voter Ranks Only Few Candidates (AAAI 2020 · similarity 0.87)
- Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning (NeurIPS 2022 · similarity 0.86)
- Computing Equilibrium Nominations in Presidential Elections (AAAI 2026 · similarity 0.86)
- Verifying Proportionality in Temporal Voting (AAAI 2025 · similarity 0.85)
- Welfare Maximization in Perpetual Voting (Student Abstract) (AAAI 2024 · similarity 0.85)
- Tight Bounds on the Distortion of Randomized and Deterministic Distributed Voting (NeurIPS 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.
