A finite exact algorithm for epsilon-core membership in two dimensions

DOI10.1016/J.MATHSOCSCI.2010.07.004zbMATH Open1200.91095OpenAlexW1987689381MaRDI QIDQ607258FDOQ607258

Authors: Craig A. Tovey 

Publication date: 19 November 2010

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2010.07.004

Recommendations

• On a generalization of the \(\epsilon\)-algorithm
• An algorithmic criterion for basicness in dimension 2
• An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions
• The epsilon algorithm and related topics
• Exact algorithms for size constrained 2-clustering in the plane
• Bounds for membership functions: A corelation-based approach
• scientific article; zbMATH DE number 2233588
• scientific article; zbMATH DE number 7759298
• The discrete Pólya algorithm on finite spaces
• An efficient exhaustive search algorithm for the Escherization problem

zbMATH Keywords

algorithmvotingspatial modelepsilon core

Mathematics Subject Classification ID

Voting theory (91B12) Spatial models in economics (91B72)

Cites Work

• Optimal location of candidates in ideological space
• The instability of instability of centered distributions
• Approximation of the yolk by the LP yolk
• Title not available (Why is that?)
• A polynomial-time algorithm for computing the yolk in fixed dimension

Cited In (3)

• On the uniqueness of the yolk
• Finessing a point: augmenting the core
• Dominance in spatial voting with imprecise ideals

This page was built for publication: A finite exact algorithm for epsilon-core membership in two dimensions

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