Faster algorithms for computing plurality points

DOI10.4230/LIPICS.SOCG.2016.32MaRDI QIDQ3132866zbMATH OpenOpenAlexFDO

Authors Joachim Gudmundsson, Mehran Mehr, Mark de Berg

Publication date 30 January 2018

Full work available at URL http://dx.doi.org/10.4230/LIPIcs.SoCG.2016.32

zbMATH Keywords

computational geometrycomputational social choicevoting theoryCondorcet pointsplurality points

Mathematics Subject Classification ID

Social choice (91B14) Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Voting theory (91B12)

Recommendations

• Faster algorithms for computing plurality points
• Computing Plurality Points and Condorcet Points in Euclidean Space
• Forming Plurality at Minimum Cost
• Condorcet and median points of simple rectilinear polygons
• On condorcet and median points of simple rectilinear polygons

Cited in

(4)

• On β-Plurality Points in Spatial Voting Games.
• Faster algorithms for computing plurality points
• Fast algorithms for weighted myriad computation by fixed-point search
• Computing Plurality Points and Condorcet Points in Euclidean Space

This page was built for publication: Faster algorithms for computing plurality points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132866)