atlas

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

An Analysis Framework for Metric Voting based on LP Duality

AAAI 2020 · Learning theory and algorithms › Submodular and game algorithms · approach: Committee voting rules · 27 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 LP duality and construct low-cost flows instead of reasoning directly over consistent metric spacesMetric distortion analysis · Metric votingdistortion upper boundHelped
Apply the generalized preference-chain bound to Ranked PairsRanked Pairs · Metric voting, n candidatesdistortion: at most 2 \sqrt{2} \cdot \sqrt{n} + o(\sqrt{n}); at least \frac{\sqrt{2}}{2} \sqrt{n}Mixed
Apply the generalized preference-chain bound to SchulzeSchulze · Metric voting, n candidatesdistortion: at most 2 \sqrt{2} \cdot \sqrt{n} + o(\sqrt{n}); at least \frac{\sqrt{2}}{2} \sqrt{n}Mixed
Require a perfect matching in each candidate-comparison bipartite graphAll Bipartite Matchings · Metric votingdistortion upper bound: 3Helped
Use preference chains of arbitrary length rather than only short majority-preference pathsDistortion bounds for candidate paths · Metric votingdistortion upper bound: 2+\sqrt{5} \approx 4.236Helped

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