atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Comparing Election Methods Where Each Voter Ranks Only Few Candidates

AAAI 2020 · Learning theory and algorithms › Submodular and game algorithms · approach: Committee voting rules · 9 citations (OpenAlex)

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use randomized rather than deterministic elicitationBorda approximation · 1D and MMM preference distributionsapproximation ratioHelped
Use randomized rather than deterministic elicitationBorda approximation · IC and SPIC preference distributionsapproximation ratioHurt
Use randomized rather than deterministic elicitationMinimax approximation · Preference distributions testedapproximation ratioMixed
Increase the number of randomly ranked candidates per voterRandomized Minimax approximation · Minimax, m=50approximation ratioHelped
Use Deter-avg rather than the other two deterministic heuristics (ablation)Borda approximation · Preference distributions testedapproximation ratioNo clear effect
Use the deterministic algorithm rather than either tested natural heuristic (ablation)Minimax approximation · Preference distributions testedapproximation ratioHelped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy