Faster algorithms for computing plurality points

DOI10.1145/3186990MaRDI QIDQ4554364zbMATH OpenOpenAlexWikidataFDO

Authors Joachim Gudmundsson, Mehran Mehr, Mark de Berg

Publication date 13 November 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2016/5924/

zbMATH Keywords

computational geometrycomputational social choiceCondorcet pointsplurality pointsVoronoi gamesvoting theory

Mathematics Subject Classification ID

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

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

(9)

• Fast algorithms for weighted myriad computation by fixed-point search
• Computing Plurality Points and Condorcet Points in Euclidean Space
• Faster algorithms for computing plurality points
• On β-Plurality Points in Spatial Voting Games
• Optimal algorithms for geometric centers and depth
• The one-round multi-player discrete Voronoi game on grids and trees
• On β-Plurality Points in Spatial Voting Games.
• Improved bounds for discrete Voronoi games
• Plurality in spatial voting games with constant

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 Q4554364)