A polynomial-time algorithm for computing the yolk in fixed dimension

DOI10.1007/BF01581084MaRDI QIDQ687092zbMATH OpenFDO

Authors Craig A. Tovey

Publication date 20 December 1993

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

NP-harddynamic voting gameEuclidean spatial model

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Voting theory (91B12)

Recommendations

• scientific article; zbMATH DE number 1538128
• scientific article; zbMATH DE number 3945871
• The global proof of the Polak-Ribière-Polak algorithm under the YWL inexact line search technique
• Polynomial-time algorithm for fixed points of nontrivial morphisms
• An algorithm of polynomial order for computing the covering dimension of a finite space
• A Polynomial Time Complexity Bound for Computations on Curves
• scientific article; zbMATH DE number 819105
• scientific article; zbMATH DE number 69493
• The Polya algorithm on cylindrical sets
• A non-NP-complete algorithm for a quasi-fixed polynomial problem

Cites work

• scientific article; zbMATH DE number 3148878 (Why is no real title available?)
• scientific article; zbMATH DE number 3930664 (Why is no real title available?)
• scientific article; zbMATH DE number 4083375 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• A Note about the "Nowhere Denseness" of Societies Having an Equilibrium under Majority Rule
• A theorem connecting Shapley-Owen power scores and the radius of the yolk in two dimensions
• Advances in the spatial theory of voting.
• General Conditions for Global Intransitivities in Formal Voting Models
• Instability of Simple Dynamic Games
• Limiting distributions for continuous state Markov voting models
• Limiting median lines do not suffice to determine the yolk
• Limits on agenda control in spatial voting games
• On the number of line separations of a finite set in the plane
• Optimal location of candidates in ideological space
• Polygonal intersection searching
• Probability and convergence for supra-majority rule with Euclidean preferences
• Recognizing majority-rule equilibrium in spatial voting games
• The almost surely shrinking yolk
• The densest hemisphere problem
• The size of the yolk: Computations for odd and even-numbered committees
• The uncovered set in spatial voting games

Cited in

(9)

• Generalized medians and a political center
• Approximation of the yolk by the LP yolk
• The instability of instability of centered distributions
• On the uniqueness of the yolk
• A bird's eye-view of min-max and max-min functionals
• The generalized yolk point
• A finite exact algorithm for epsilon-core membership in two dimensions
• The size of the yolk: Computations for odd and even-numbered committees
• Optimal algorithms for geometric centers and depth

This page was built for publication: A polynomial-time algorithm for computing the yolk in fixed dimension

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