A suite of convex-hull forbidden substructures, reduction rules, ILP, and QCP recognizes 2-Euclidean elections quickly, solving 283 more PrefLib instances than the previous algorithm.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Practical approach to $2$-Euclidean Preferences
A suite of convex-hull forbidden substructures, reduction rules, ILP, and QCP recognizes 2-Euclidean elections quickly, solving 283 more PrefLib instances than the previous algorithm.