AI Paper Atlas

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

Favorite-Candidate Voting for Eliminating the Least Popular Candidate in a Metric Space

Xujin Chen, Minming Li, Chenhao Wang

AAAI 2020 · Learning theory and algorithms › Submodular and game algorithms · approach: Committee voting rules

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
Choose the committee minimizing projection distanceFavorite-candidate voting, general metric, social cost · General metricdistortion: 3Improved
Use power-proportional probabilities to select committeesFavorite-candidate voting, general metric, social cost · General metricdistortion: 3-\frac{2}{m}Improved
Choose the eliminated candidate maximizing projection distanceFavorite-candidate voting, general metric, social utility · General metricdistortion: 3Improved
Select committees proportional to the number of voters not voting for the eliminated candidateProportionality · Simplex, social utilitydistortion: 3-\frac{4}{m+2}Improved
Select committees proportional to the number of voters not voting for the eliminated candidateProportionality · Two candidates, social utilitydistortion: 1.523Improved
Use vote-location-dependent probabilities to randomize between the two endpointsLeft-or-Right · Real line, social utilitydistortion: \frac{13}{7}Improved

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