Recognizing 1-Euclidean Preferences: An Alternative Approach

DOI10.1007/978-3-662-44803-8_13zbMath1403.91130OpenAlexW14679004MaRDI QIDQ2938654

Edith Elkind, Piotr Faliszewski

Publication date: 14 January 2015

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44803-8_13

zbMATH Keywords

polynomial-time algorithmvoters' preferences1-Euclidean election

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (7)

Are there any nicely structured preference profiles nearby? ⋮ Testing a mixture model of single-peaked preferences ⋮ A characterization of the single-peaked single-crossing domain ⋮ Multidimensional Manhattan preferences ⋮ On the parameterized complexity of party nominations ⋮ Small one-dimensional Euclidean preference profiles ⋮ Structured preferences: a literature survey

This page was built for publication: Recognizing 1-Euclidean Preferences: An Alternative Approach